Logic challenge 1
Father, mother, 2 daughters ,2 sons, a policeman and a thief stand on a bank. You have to make sure that all the 8 reach the other bank. However you have to do it according to the following rules.What is the minimum number of moves you can make to succed the task?
RULES:
-
Only 2 people on the raft at a time
-
The Father cannot stay with any of the daughters, without their Mother’s presence
-
The Mother cannot stay with any of the sons, without their Father’s presence
-
The thief (striped shirt) cannot stay with any family member, if the Policeman is not there
-
Only the Father, the Mother and the Policeman know how to operate the raft
The answer is 17.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
2 solutions
Moderator note:
This solution is incorrect as it allows for the Father and daughter to be on the raft at the same time, whereas we are told that they cannot stay together.
This puzzle was great and does not require any background knowledge, therefore I loved it. To be very honest, it took me 2 tries because once I did not notice a little mistake i had made.
Now, coming to the solution:
Assume the people to be: F,M, D1, D2, S1, S2, P and T.
1. P and T (T remains on 2nd bank)
2. P returns.
3. P and D1 go (D1 remains on the 2nd bank).
4. P and T return.
5. M and D2 go (D2 remains on the 2nd bank).
6. M returns.
7. M and F go ( M remains on the 2nd bank).
8. F returns.
9. P and T go. (Both remain on 2nd bank).
10. M returns.
11. M and F go. (M remains on 2nd bank).
12. F returns.
13. F and S1 go. (Both remain on the 2nd bank).
14. P and T return.
15. P and S1 go. (S1 remains.)
16. P returns.
17. P and T go. (Both remain.)
Done and dusted.
The answer is therefore 1 7