The number of states to be generated can be limited to the given value, resulting in the search being abandoned at that point. In a tree, search states that can be reached by multiple paths will also be explored multiple times. If the search space is to be searched as a graph, multiple paths leading to the same node will usually only be explored once. Next, there are some configuration options for the search process. To search for a solution, first select a search strategy. Either should bring up a window that looks essentially like the one shown in figure 2. Alternatively, run the command "java -jar MissionariesAndCannibalsApp.jar" from the command line.
#Pdf the missionaries and cannibals problem and solution download
Download the application and double-click it. MissionariesAndCannibalsApp is a Java application that explores the above search space using a number of (uninformed) search strategies. The MissionariesAndCannibalsApp Java Application The initial state is shown again on the left, whereas the goal state is all the way to the right. 2c represents the action of two cannibals crossing the river. The complete search space is shown in figure 1.įigure 1: Search-space for the Missionaries and Cannibals problemĪrrows in figure 1 represent state transitions and are labelled with actions, e.g. The goal state is effectively a mirror image of the initial state. This problem can be solved by searching for a solution, which is a sequence of actions that leads from the initial state to the goal state. The initial state is shown to the right here, where black triangles represent missionaries and red circles represent cannibals. How can the boat be used to safely carry all the missionaries and cannibals across the river? If the cannibals ever outnumber the missionaries on either of the river’s banks, the missionaries will get eaten. There is one boat available that can hold up to two people and that they would like to use to cross the river. On one bank of a river are three missionaries and three cannibals. The Missionaries and Cannibals problem is a classic AI puzzle that can be defined as follows:
0 kommentar(er)
