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 Banker's Puzzle.
Money Puzzles
The Ruby Brooch.
Unclassified Problems.
The Rookery.
The Guarded Chessboard
The Seven Pigs.
Various Dissection Puzzles
Lions And Crowns.
Chessboard Problems
Inspecting A Mine.
Unicursal and Route Problems
The Three Teacups
THE SQUIRE'S CHRISTMAS PUZZLE PARTY
Eight Jolly Gaol Birds.
Magic Squares Problem.
The Sultan's Army.
Money Puzzles
The Queen's Journey.
The Guarded Chessboard
The Antiquary's Chain.
Combination and Group Problems
The Family Ages.
Money Puzzles
Chequered Board Divisions.
Chessboard Problems
The Honest Dairyman.
Measuring, Weight, and Packing Puzzles.
The Abbot's Puzzle.
Money Puzzles