The missionaries have been caught by a man-eating tribe when they are preaching in the distant lands.

The chieftain of the tribe requires the missionaries to solve an ancient riddle or they will be cooked.

Your goal in this game is to find out the answer of the riddle by transferring the clergymen and the cannibals to the opposite bank of the river.

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.

Please help improve this article by adding citations to reliable sources.

Find sources: Toy problem news newspapers books scholar JSTOR ( May 2016 ) ( Learn how and when to remove this template message ).

A toy problem is useful to test and demonstrate methodologies.

Researchers can use toy problems to compare the performance of different algorithms.

They are also good for game designing.

Often these problems distill a few important aspects of complicated problems so that they can be studied in isolation.

Toy problems are thus often very useful in providing intuition about specific phenomena in more complicated problems.

Artificial Intelligence: A Modern Approach (3 ed.).

Heuristics: intelligent search strategies for computer problem solving.

ISBN 0-201-05594-5.

Wikipedia is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.

Missionaries Games Missionaries And Cannibals Problem In Ai