page_title: Missionaries and cannibals problem
section_title: Solution
hierarchical_section_title: Missionaries and cannibals problem / Solution
caption_attribution_description: English: Graphic of solution to Jealous Husbands River Crossing Problem.
context_page_description: The missionaries and cannibals problem, and the closely related jealous husbands problem, are classic river-crossing logic puzzles. The missionaries and cannibals problem is a well-known toy problem in artificial intelligence, where it was used by Saul Amarel as an example of problem representation.
context_section_description: The earliest solution known to the jealous husbands problem, using 11 one-way trips, is as follows.  The married couples are represented as α (male) and a (female), β and b, and γ and c., p. 291.
  This is a shortest solution to the problem, but is not the only shortest solution., p. 291. 
  If however, only one man can get out of the boat at a time and husbands must be on the shore to count as with his wife as opposed to just being in the boat at the shore: move 5 to 6 is impossible, for as soon as γ has stepped out b on the shore won't be with her husband, despite him being just in the boat.
  As mentioned previously, this solution to the jealous husbands problem will become a solution to the missionaries and cannibals problem upon replacing men by missionaries and women by cannibals.  In this case we may neglect the individual identities of the missionaries and cannibals.  The solution just given is still shortest, and is one of four shortest solutions.
  If a woman in the boat at the shore (but not on the shore) counts as being by herself (i.e. not in the presence of any men on the shore), then this puzzle can be solved in 9 one-way trips:
caption: Graphic of solution to Jealous Husbands River Crossing Problem.
exif: {}