You will be given a raft floating on the river, while 3 clergymen and 3 cannibals are on a shore. Click to transfer 1 to 2 persons on board as the raft cannot move without passengers. Then click the raft so that the passengers can travel to the opposite bank. When the raft arrives, you may click to settle the passengers.
Note that when the number of missionaries is smaller than that of the cannibals on a side, the clergymen will be eaten and the game will end. The time you have spent is recorded at the top left corner. Save the missionaries so that they can return home! Friends can send private messages, send instant photo attachments and chat with each other - live! All LetsHangOut. On one bank of a river are three missionaries and three cannibals. There is one boat available that can hold up to two people and that they would like to use to cross the river.
How can the boat be used to safely carry all the missionaries and cannibals across the river? The initial state is shown to the right here, where black triangles represent missionaries and red circles represent cannibals. 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 goal state is effectively a mirror image of the initial state.
The complete search space is shown in figure 1. Arrows in figure 1 represent state transitions and are labelled with actions, e. The initial state is shown again on the left, whereas the goal state is all the way to the right. MissionariesAndCannibalsApp is a Java application that explores the above search space using a number of uninformed search strategies.
Download the application and double-click it. Alternatively, run the command 'java -jar MissionariesAndCannibalsApp. Either should bring up a window that looks essentially like the one shown in figure 2. To search for a solution, first select a search strategy.
Next, there are some configuration options for the search process. If the search space is to be searched as a graph, multiple paths leading to the same node will usually only be explored once. In a tree, search states that can be reached by multiple paths will also be explored multiple times. The number of states to be generated can be limited to the given value, resulting in the search being abandoned at that point. Save the missionaries so that they can return home!
Tell us your comments about Missionaries and Cannibals. Submit comment failed, please try again Submit. Cake Decoration Use logical thinking rather than art skills to decorate the cake. Pointers Fill in numbers according to the arrows.
0コメント