VIEW THE MOBILE VERSION of www.mathpuzzle.ca Informational Site Network Informational
Privacy
Home Top Rated Puzzles Most Viewed Puzzles All Puzzle Questions Random Puzzle Question Search


VISITING THE TOWNS.





(Unicursal and Route Problems)
A traveller, 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 cross roads, but go straight from town to town.
This is an absurdly easy puzzle, if you go the right way to work.


Read Answer






Next: THE FIFTEEN TURNINGS.

Previous: THE TUBE INSPECTOR'S PUZZLE.



Add to Informational Site Network
Report
Privacy
ADD TO EBOOK




Random Questions

The Frogs And Tumblers
THE PROFESSOR'S PUZZLES
The Hat Puzzle.
Moving Counter Problem
The Paper Box.
Various Dissection Puzzles
Catching The Hogs
MISCELLANEOUS PUZZLES
The Fifteen Dominoes.
Combination and Group Problems
Mr. Gubbins In A Fog.
Money Puzzles
Find The Man's Wife.
Unclassified Problems.
The Crusader.
The Guarded Chessboard
Mixing The Tea.
Measuring, Weight, and Packing Puzzles.
The Dorcas Society
MISCELLANEOUS PUZZLES
Counter Crosses.
Combination and Group Problems
A New Counter Puzzle.
The Guarded Chessboard
The Fifteen Orchards
MISCELLANEOUS PUZZLES
The Coloured Counters.
Chessboard Problems
The Artillerymen's Dilemma.
Money Puzzles