There are 8 people that need to cross a river. The water is too deep and fast to walk or swim across, and the only transportation device available is a raft. The raft can only be operated by adults, cannot float across the river on its own, and can carry at most two people.
The 8 people are a juvenile delinquent, her jailer, and a dysfunctional family of six: mother, father, two sons, and two daughters. To be clear, the only adults are the jailer, the mother, and the father.
Unfortunately some people fight with each other:
The juvenile delinquent will fight with anybody if her jailer is not present.
The father fights with either daughter if the mother is not present to mediate.
The mother fights with either son if the father is not present to mediate.
How can these 8 people cross the river without any fights? How many trips on the raft did it take?
For a fun way to test out your theories, click here and then click on the blue circle.
Here is the output of a program I wrote in Perl
(the letters are self-explanatory):
DJFMBBGG || ||
FMBBGG || >DJ> ||
FMBBGG || || DJ
FMBBGG || <J < || D
JFMBBGG || || D
FMBGG || >JB> || D
FMBGG || || DJB
FMBGG || <DJ< || B
DJFMBGG || || B
DJMGG || >FB> || B
DJMGG || || FBB
DJMGG || <F < || BB
DJFMGG || || BB
DJGG || >FM> || BB
DJGG || || FMBB
DJGG || <M < || FBB
DJMGG || || FBB
MGG || >DJ> || FBB
MGG || || DJFBB
MGG || <F < || DJBB
FMGG || || DJBB
GG || >FM> || DJBB
GG || || DJFMBB
GG || <M < || DJFBB
MGG || || DJFBB
G || >MG> || DJFBB
G || || DJFMBBG
G || <DJ< || FMBBG
DJG || || FMBBG
D || >JG> || FMBBG
D || || JFMBBGG
D || <J < || FMBBGG
DJ || || FMBBGG
|| >DJ> || FMBBGG
|| || DJFMBBGG
|
|
Posted by Bractals
on 2005-09-27 21:32:57 |
Solution
