Here is another queer traveling puzzle, the solution of which calls for ingenuity. In this case, the traveler starts from the black town and wishes to go as far as possible while making only fifteen turnings and never going along the same road twice. The towns are supposed to be a mile apart. Supposing, for example, that he went straight to $A,$ then straight to $B,$ then to $C, D, E,$ and $F,$ you will then find that he has traveled thirty-seven miles in five turnings. Now, how far can he go in fifteen turnings?
Solutions: 1
This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this edition or online at http://www.gutenberg.org. If you are not located in the United States, you'll have to check the laws of the country where you are located before using this ebook.
