Three missionaries and three cannibals come to a river. There is a boat on their side of the
river that can be used by either one or two persons. How should they use this boat to cross
the river in such a way that cannibals never outnumber the missionaries on either side of the
river.
(a) Specify the form of state description, the initial state and the goal state for this problem. Describe the state space using variables (as if you are using an array in a program)
Determine how many states are in state space.
(b) Describe the set of operators using if - then rules.
(c) Draw the entire state space graph
(include only legal states, that is, states in which cannibals do not outnumber missionaries on either side of the river
(d) Describe a dept - first search algorithm and show a trace leading to a solution.