Free puzzles / Question / Unicursal and Route Problems
The Sailor's Puzzle.
The sailor depicted in the illustration stated that he had since his
boyhood been engaged in trading with a small vessel among some twenty
little islands in the Pacific. He supplied the rough chart of which I
have given a copy, and explained that the lines from island to island
represented the only routes that he ever adopted. He always started from
island A at the beginning of the season, and then visited every island
once, and once only, finishing up his tour at the starting-point A. But
he always put off his visit to C as long as possible, for trade reasons
that I need not enter into. The puzzle is to discover his exact route,
and this can be done with certainty. Take your pencil and, starting at
A, try to trace it out. If you write down the islands in the order in
which you visit them--thus, for example, A, I, O, L, G, etc.--you can at
once see if you have visited an island twice or omitted any. Of course,
the crossings of the lines must be ignored--that is, you must continue
your route direct, and you are not allowed to switch off at a crossing
and proceed in another direction. There is no trick of this kind in the
puzzle. The sailor knew the best route. Can you find it?
Answer
The first thing to do in trying to solve a puzzle like this is to
attempt to simplify it. If you look at Fig. 1, you will see that it is a
simplified version of the map. Imagine the circular towns to be buttons
and the railways to be connecting strings. (See solution to No. 341.)
Then, it will be seen, we have simply "straightened out" the previous
diagram without affecting the conditions. Now we can further simplify by
converting Fig. 1 into Fig. 2, which is a portion of a chessboard. Here
the directions of the railways will resemble the moves of a rook in
chess--that is, we may move in any direction parallel to the sides of
the diagram, but not diagonally. Therefore the first town (or square)
visited must be a black one; the second must be a white; the third must
be a black; and so on. Every odd square visited will thus be black and
every even one white. Now, we have 23 squares to visit (an odd number),
so the last square visited must be black. But Z happens to be white, so
the puzzle would seem to be impossible of solution.
[Illustration: Fig. 1.]
[Illustration: Fig. 2.]
As we were told that the man "succeeded" in carrying put his plan, we
must try to find some loophole in the conditions. He was to "enter every
town once and only once," and we find no prohibition against his
entering once the town A after leaving it, especially as he has never
left it since he was born, and would thus be "entering" it for the first
time in his life. But he must return at once from the first town he
visits, and then he will have only 22 towns to visit, and as 22 is an
even number, there is no reason why he should not end on the white
square Z. A possible route for him is indicated by the dotted line from
A to Z. This route is repeated by the dark lines in Fig. 1, and the
reader will now have no difficulty in applying; it to the original map.
We have thus proved that the puzzle can only be solved by a return to A
immediately after leaving it.