by
Erik Oosterwal
1. Mr. and Mrs. Able row across.
Bb Cc | Aa |
2. Mr. Able leaves the Mrs. on the far side and returns alone.
A Bb Cc | a |
3. Mrs. Baker and Mrs. Charlie row over to the far side.
A B C | a b c |
4. Mrs. Able returns alone.
Aa B C | b c |
5. Mr. Baker and Mr. Charlie row to the far side.
Aa | Bb Cc |
6. Mr. and Mrs. Baker return together.
Aa Bb | Cc |
7. Mr. Able and Mr. Baker row over together.
a b | A B Cc |
8. Mrs. Charlie returns alone.
a b c | A B C |
9. Mrs. Able and Mrs. Baker row over together.
c | Aa Bb C |
10. Mrs. Able returns alone.
a c | A Bb C |
11. Mrs. Able and Mrs. Charlie row over together.
Aa Bb Cc |
At no time was a wife in the presence of another man without her husband
being there to protect her honor.
Now, since the boat is on the far side, how does the next set of couples
get across? Also, is there a fixed algorithm for N couples?
See all the brain teasers on The Puzzle Page.
Get daily puzzles in your RSS reader at The Puzzle Page Blog Site.
Looking for answers to computer programming problems?
Read what's going on in the Computer Science 101 classroom.