There are 3 cannibals and 3 missionaries on one side of a river

  • Thread starter Thread starter airbusman
  • Start date Start date
  • Tags Tags
    River
AI Thread Summary
The discussion revolves around solving the classic problem of transporting three cannibals and three missionaries across a river without violating the condition that cannibals never outnumber missionaries on either side. The initial attempt focuses on using variables to represent the number of missionaries and cannibals on each side but fails to outline a clear procedure for the crossings. Key points include the need to describe a step-by-step method that adheres to the problem's constraints and the importance of considering the boat's occupants during each crossing. Suggestions are made to start with one missionary and one cannibal crossing, emphasizing that temporary imbalances can be managed if the cannibals can be trusted to follow instructions. The discussion highlights the complexity of the problem and the necessity of a systematic approach to find a solution.
airbusman
Messages
11
Reaction score
0
In the textbook used for my problem solving and proofs course, one of the questions asks me to develop a geometric or algebraic representation of various questions. Here is one that I'm having trouble with:

"Three cannibals and three missionaries are together on one side of the river. They wish to cross the river, and they have a boat that can carry two people. Describe a procedure for transporting all six people across the river in such a way that there are never more cannibals than missionaries on anyone side at a given time."

I tried really hard, and all I could come up with was this (don't laugh):

1) let "a" be the number of missionaries on side 1
2) "b" cannibals
3) "c" missionaries side 2
4) "d" cannibals

a > b and c > d at all times.

What am I doing wrong?
 
Physics news on Phys.org
airbusman said:
In the textbook used for my problem solving and proofs course, one of the questions asks me to develop a geometric or algebraic representation of various questions. Here is one that I'm having trouble with:

"Three cannibals and three missionaries are together on one side of the river. They wish to cross the river, and they have a boat that can carry two people. Describe a procedure for transporting all six people across the river in such a way that there are never more cannibals than missionaries on anyone side at a given time."

I tried really hard, and all I could come up with was this (don't laugh):

1) let "a" be the number of missionaries on side 1
2) "b" cannibals
3) "c" missionaries side 2
4) "d" cannibals

a > b and c > d at all times.

What am I doing wrong?

1) The problem asks you to find a procedure that satisfies certain conditions/goals. You have merely expressed part of that goal using mathematical notation. You need to describe the procedure that satisfies that goal.
2) The problem says "never more than", so the goal is ##a\geq b## and ##c\geq d## at all times.
3) It doesn't look like you're taking into account the folks in the boat.

Here is a link to a similar problem to give you an idea what your solution should look like. http://en.wikipedia.org/wiki/Fox,_goose_and_bag_of_beans_puzzle

I'll trust that you won't be a cheater and click the link on the bottom of that page.
 
Hint: do you agree that it can never happen that one missionary is by himself on the boat?
 
Sure he can. A missionary can take one cannibal across and drop her off. Then he can go back and forth alone as much as he wants. He won't make much progress though. But I do have a question, can the cannibals be trusted to do what they are told, so you could send two cannibals across and have one return, for example?
 
Wouldn't dropping off a cannibal mean that one side has more cannibals than missionaries?
 
Which is not a problem if the number of missionaries on that side is 0!

For example you could start by having one missionary and one cannibal cross. The missionary goes back alone (1 cannibal on one side, two cannibals and two missionaries on the other, one missionary in the boat.), picks up another cannibal, drops him off and goes back alone (two cannibals on one side, two missionaries and one cannibal on the other, one missionary in the boat). Now what must be done?
 
Last edited by a moderator:
HallsofIvy said:
Which is not a problem if the number of missionaries on that side is 0!

For example you could start by having one missionary and one cannibal cross. The missionary goes back alone (1 cannibal on one side, two cannibals and two missionaries on the other, one missionary in the boat.), picks up another cannibal, drops him off and goes back alone...

I was wondering if that's allowed. When he drops the second cannibal off there are momentarily 2 cannibals and 1 missionary on that side. Also as I asked earlier, can the cannibals be trusted to follow instructions? If so there is a solution avoiding even momentarily violating the cannibal/missionary ratio.
 
Last edited:
That question occurred to me. I have this image of the single missionary picking up the single cannibal on the boat with him and throwing the cannibal the last few feet to the shore!
 

Similar threads

Back
Top