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 del.icio.us Add to Reddit Add to Digg Add to Del.icio.us Add to Google Add to Twitter Add to Stumble Upon
Add to Informational Site Network
Report
Privacy
SHAREADD TO EBOOK




Random Questions

The Archery Butt
PUZZLING TIMES AT SOLVAMHALL CASTLE
How To Make Cisterns.
Patchwork Puzzles
The Great Scramble.
Money Puzzles
The Nine Treasure Boxes.
Money Puzzles
The Eleven Pennies
THE SQUIRE'S CHRISTMAS PUZZLE PARTY
The Silk Patchwork
GREEK CROSS PUZZLES
Crossing The Moat
THE STRANGE ESCAPE OF THE KING'S JESTER
Under The Veil.
Chessboard Problems
The Greyhound Puzzle.
The Guarded Chessboard
Counter Solitaire.
The Guarded Chessboard
The Cornish Cliff Mystery
Adventures of the Puzzle Club
The Amazons.
Chessboard Problems
The Riddle Of The Cellarer
THE MERRY MONKS OF RIDDLEWELL
The Union Jack.
Unicursal and Route Problems
Water, Gas, And Electricity.
Unicursal and Route Problems