03-14-2012, 05:38 AM
You have M missionaries and C cannibals on one side of a river (M > C). There is one rowboat
which can hold two people in it. If there are ever more cannibals on one side of the river than there
are missionaries on that side, the cannibals will eat the missionaries there (failed solution). Find the
minimum sequence of moves that will take all the missionaries and cannibals across the river, without
any harm to the missionaries.
03-14-2012, 05:40 AM
review forum rules (http://www.codingforums.com/showthread.php?t=2090)
3) Do your homework first. Only post the part of the script you're having trouble with! There are generally two types of people- ones that simply dump their entire page or problem and expect everyone to spend hours solving everything for them, and those that do their own homework first, and only ask very specific, manageable questions. The later invariably gets more and better responses from others. When you're lazy, do not expect us to be hardworking for you.
i) Post the entire script and simply say "Please debug this script for me!"
The second question will get a LOT more quality responses, as it is concise, manageable, and not overwhelming. Remember, ask for the world, and you'll get nothing. Ask for a little, and you'll get a lot.
03-14-2012, 05:42 AM
dude, that's not even a programming question...
Just like the other it's merely a logic puzzle; probably for a math class.