On one bank of a river are three missionaries, three cannibals, and a boat. They would all like to cross to the other side of the river. The boat will hold up to two people. But if the cannibals ever outnumber the missionaries on one side of the river, the missionaries will be eaten. The missionaries would like to avoid this fate, and the cannibals are a kind-hearted bunch (if lacking in self-control), so they agree to develop a plan to get all six men across the river safely.
Using a simple "iconic" representation of states in this problem, show how our generic search algorithm would explore this search space. For this problem, assume that the algorithm favors new states in its exploration. Be sure to go far enough that the algorithm considers at least one state three moves away from the initial state.
A generic algorithm for systematic search
Figure for Problem 7