There are 3 policemen and 3 thieves. They have to cross a river, but if the number of thieves is greater than or equal to the number of policemen, they will break free!
With only one boat, what is the fewest number of moves that must be made?
Note:
The thieves can travel alone on the boat, and can be left alone.
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.
First, let the thieves go there first (3 moves), then bring 1 thief back and bring 2 policemen there (2 moves). Then 1 police and 1 thief back and bring all the policemen there (2 moves). Next take back 1 thief and take all to the end of the river (4 moves) total 11 moves