A group of N people start off on one side of a poison river. They have a pair of magic shoes which allow their feet to touch the river without killing them. They can not jump across the river or throw the shoes across the river. Each person must use the shoes exactly once to cross the river. How can the entire group get across the river?
For N=3, if the people are named A,B, and C: A wears the shoes and carries B across the river. B wears the shoes to go back across the river. C wears the shoes to carry B across the river. Each person used the shoes once, and all three people ended up on the other side of the river. How can the conditions be met for N=4? N=6? N=7? Don -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
