missionaries games missionaries and cannibals problem in ai

To illustrate this, consider the following diagram, where each of the ovals is an individual state: What is of specific interest, is how the breadth first search actually goes about looking for a solution state. Typically, a search space is a list or some sort of collection which contains each of the states that is to be checked to see if it is a solution state.Ī breath first search relies upon the basic search principles mentioned above. Search is generally concerned with looking for a solution, or solutions in a search space of individual search states. This article uses breadth first search, as this search method is guaranteed to find a solution state. Each of these different search methods has different properties such as whether a result is guaranteed, and how much time and space is needed to carry out a search. Well, there are different varieties of search which can all be used, such as breadth first, depth first, or iterative deepening. (The idea being that if this happens, the missionaries will then be able to corrupt the cannibals by 'converting' them.) To solve this problem satisfactorily, your program must explicitly identify all of the optimal (i.e., shortest) solutions to the problem.

The problem is to find the shortest sequence of transfers which gets all six people from one side to the other without ever creating a situation where missionaries outnumber cannibals on either side of the river. No more than two people can fit in the boat and it must have at least one person in it during any transfer.

There is a boat which can be used to transfer people from one side of the river to the other.

On one side of a river, there are three missionaries and three cannibals. So what is the problem that are trying to solve This article describes how to solve a logic problem using the AI Search technique.

Missionaries games missionaries and cannibals problem in ai