In lab 4 we will look at some problems from the textbook and formulate them as search problems.
We will start by splitting the class into four groups. Each group should formulate the following problems as search problems by giving an initial state, the goal test, successor function and cost function. You don't need to write any code, but describe these things precisely enough so that they could be implemented. You will have 15-20 minutes (total) to discuss all the problems. After this time, each group will present their solution to one problem (assigned randomly to the groups) and discuss it with the class.
The problems come from problem 3.7 on page 90 in the textbook.
If we have time, we'll also look at the missionaries and cannibals problem from problem 3.9. Three missionaries and three cannibals are on one side of a river, along with a boat that can hold one or two people. The task is to find a way to transport everyone to the other side, without ever leaving a group of missionaries in one place outnumbered by cannibals in that place, because then the missionaries will be eaten.
To play with this problem and get a feeling for it, have a look at an interactive version online: http://www.learn4good.com/games/puzzle/boat.htm
In the second period we'll introduce the first problem set, due in one week. We'll also be happy to assist with LISP matters regarding to the current assignment due tonight.