THE MOTOR-CAR TOUR.
(Unicursal and Route Problems
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
Next: THE LEVEL PUZZLE.
Previous: A BANK HOLIDAY PUZZLE.