Free puzzles / Question / Unicursal and Route Problems
Visiting The Towns.
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.
Answer
It will be seen from the illustration (where the roads not used are
omitted) that the traveller can go as far as seventy miles in fifteen
turnings. The turnings are all numbered in the order in which they are
taken. It will be seen that he never visits nineteen of the towns. He
might visit them all in fifteen turnings, never entering any town twice,
and end at the black town from which he starts (see "The Rook's Tour,"
No. 320), but such a tour would only take him sixty-four miles.