missionaries games missionaries and cannibals problem in ai

For the upper problem, the M=3, C=3 and B=2.

The primary argument for the system is the number of Missionaries (M), the number of Cannibals (C) and the capacity of the boat (B).

The detailed algorithm can be described as such: Through this method, we can solve the problem with the help of computer graph theory knowledge to find a connected one-way graph path. We also need to define the initial state and the final state, so the problem solving is abstracted as finding a path from the initial state to the final state. To build a system to solve this problem, we can define how to represent the state of the system and how the states will change from the actions applied. How can the boat be used to carry all the missionaries and cannibals across the river safely? The boat cannot cross the river by itself with no people on board and there is no island in the middle of the river. If the cannibals ever outnumber the missionaries on either of the river’s banks or on the boat, the missionaries will get eaten. There is 1 boat available that can carry at most 2 people and that they would like to use to cross the river. On one bank of a river are 3 missionaries and 3 cannibals. The Missionaries and Cannibals Problem is usually defined as follows:

The minimal number of crossings to ferry n >= 3 missionaries and n cannibals across a river with an island, using a two-person boat and bank-to- bank crossings, is 4n - 1. 73 ( JSTOR 3619658), the following theorem was stated as the 4 th theorem without proof for this river crossing problem: In the article “The jealous husbands and the missionaries and cannibals” issued by Ian Pressman and David Singmaster on The Mathematical Gazette. The earliest version of the MCP problem was described by Pocock in 1891. The Missionaries and Cannibals Problem (MCP) is a classic river-crossing logic puzzle that derives from the famous Jealous Husbands problem.

Missionaries games missionaries and cannibals problem in ai