CE4708 Artificial Intelligence Summer 2012 (Repeats) Q1. A farmer needs to cross a river to carry his goods, a goat and a bag of cabbages, to market. He owns a small boat, which he can use to carry either the goal or the cabbages across the river, but the boat is too small to carry both goat and cabbages ar the same time. The goat is being hunted by a wolf, so the farmer can leave the goal alone or the wolf will eat it. Similarly, he can't leave the goat with the cabbages or it will eat them. Luckily, the farmer has a laptop running an Al program that he can use to plan a suitable sequence of moves to get his goods safely across the river. In this question you will design and implement this program. 1. Design a state-space representation of the problem. Explain and justify your design. In so doing you should indicate how it represents all relevant possibilities, and you may wish to indicate how it will lend itself to finding a solution based on state space or CSP search. [15 Marks ii. Design a next-state procedure that will produce a legal next state from a legal current state. 115 Marks iii. Implement a search program to solve this problem, using any search technique you think is appropriate. Be sure to justify the approach you employ, showing why it is a good technique and contrasting it with others that you feel are interior for this problem. [20 Marks CE4708 Artificial Intelligence Summer 2012 (Repeats) Q1. A farmer needs to cross a river to carry his goods, a goat and a bag of cabbages, to market. He owns a small boat, which he can use to carry either the goal or the cabbages across the river, but the boat is too small to carry both goat and cabbages ar the same time. The goat is being hunted by a wolf, so the farmer can leave the goal alone or the wolf will eat it. Similarly, he can't leave the goat with the cabbages or it will eat them. Luckily, the farmer has a laptop running an Al program that he can use to plan a suitable sequence of moves to get his goods safely across the river. In this question you will design and implement this program. 1. Design a state-space representation of the problem. Explain and justify your design. In so doing you should indicate how it represents all relevant possibilities, and you may wish to indicate how it will lend itself to finding a solution based on state space or CSP search. [15 Marks ii. Design a next-state procedure that will produce a legal next state from a legal current state. 115 Marks iii. Implement a search program to solve this problem, using any search technique you think is appropriate. Be sure to justify the approach you employ, showing why it is a good technique and contrasting it with others that you feel are interior for this problem. [20 Marks