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

Under The Mistletoe Bough
THE SQUIRE'S CHRISTMAS PUZZLE PARTY
The Pebble Game.
Puzzle Games.
The Fifteen Turnings.
Unicursal and Route Problems
Dissecting A Mitre.
Various Dissection Puzzles
The Cross And The Triangle
GREEK CROSS PUZZLES
The Gentle Art Of Stamp-licking.
Chessboard Problems
The Great Monad.
Various Dissection Puzzles
The Royal Gardens
THE STRANGE ESCAPE OF THE KING'S JESTER
Placing Halfpennies.
Unclassified Problems.
Painting A Pyramid.
Combination and Group Problems
Under The Veil.
Chessboard Problems
The Motor-car Tour.
Unicursal and Route Problems
The Chinese Chessboard.
Chessboard Problems
The Knight-guards.
The Guarded Chessboard
The Lion And The Man.
The Guarded Chessboard