CSCI 4511W Midterm: CS 4511 UMN Midterm 1key s09
Document Summary
You are given the missionaries and cannibals problem, which states that there are 3 missionaries and 3 cannibals on one side of a river, along with a boat that can hold one or two people. The problem is to nd a way to get everyone to the other side of the river without ever leaving a group of missionaries in one place outnumbered by the number of cannibals in the same place. Multiple solutions will be accepted for this problem. Here is one. (a) describe how you would represent the state space, including the states, successor function, and goal test. To describe a state, we"d want to know how many missionaries and cannibals are on either side of the river and which side of the river the boat is. The initial state is (0, 0, start), and the goal state is (3, 3, other).
