In the above diagram, the circles represent towns and the lines good roads. In just how many different ways can a motorist, starting from London (marked with an $L$), make a tour of all these towns, visiting every town once, and only once, on a tour, and always coming back to London on the last ride? The exact reverse of any route is not counted as different.
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.
