Their are three gaurds and three prisoners who need to cross a river. Their boat only holds two people at a time, and the number of prisoners must NEVER be allowed to outnumber the number of gaurds on either side of the river; otherwise, the prisoners will overpower the gaurds and, well, the story will come to an abrupt end.
Determine how many trips it will take to safely transport all of the gaurds and prisoners across the river, list each of the trips that need to be made and who is in the boat and who is on each of the riverbanks during each trip.
Inless some one can tell me a way that 2 prisoners, at some point, don't out number the guards whether they are just dropping off and still in the boat or actually on land (because even if they are just dropping off and remain in the boat they are still on the other side of the river) I conclude this to be impossible. Please let me know an alternative if you figure one out because i'm stumped.