CP468 Artificial Intelligence Assignment 4 [20 marks] Question 3 [2 marks] Find the code (all possible codes if there are any) and show how you got the solution and which rules were applied. Question 4 [2 marks] In the game tree below, it is Max's tum to move. At each leaf node is the estimated score of that resulting position as returned by the beuristic static evaluator. - Perform Mini-Max search and label each branch node with its value. - Cross out each leaf node that would be prumed by alpha-beta pruming Question 5 [2 marks] You have a 3-liter bowl, a 7-liter bowl and a 10-liter bowl, the last of which is filled with water. How can you measure exactly 5 liters of water, withour spilling amy of it outside? Describe the states, the goal state, and the operators. Draw some of the states in the tree showing a path to the goal state/ Hint: the initial state can be described as: \begin{tabular}{lrlr} 10 & 7 & 3 \\ \hline 10 & 0 & 0 \end{tabular} \begin{tabular}{|l|l|l|} \hline 10 & 0 & 0 \\ \hline \end{tabular} Question o [4 marks] The sliding-tile puzzle consists of 123 tiles and two empty spaces as in the configuration shown The puzzle has two legal moves with associated costs: - A tile may move into an adjacent empty location. This has a cost of 1. - A tile can hop over one or two other tiles into am empty position. This has a cost equal to the number of tiles junped over nzitiplied by 2 (do not count spaces when jumping). The goal is to have the following state: a) Draw part of the search tree and one path to the goal with the total cost. b) Propose a beuristic for solving this problem and draw the search tree after using the heuristic. Question 7 [4 marks] The following points A(1,1),B(2,5),C(6,3),D(7,7),F(8,5) are located in the 2 dimensional space as shown: It is required to start at point (1,1) and visit all other points at least once. You can move only on the shown dark lines (horizontal and vertical lines), and it will cost one dollar to move one unit (for example: it costs 5 dollars to move from A to B). - How many solutions? - Draw part of the search tree showing at least two possible routes amd their total costs. - Propose a beuristic to solve the problem with the mininnm cost, show the solution path and the tree afterusing the herristic