A traveler, starting from town No. $1,$ wishes to visit every one of the towns once, and once only, going only by roads indicated by straight lines. How many different routes are there from which he can select? Of course, he must end his journey at No. $1,$ from which he started, and must take no notice of crossroads, but go straight from town to town. This is an absurdly easy puzzle if you go the right way to work.
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.
