Free puzzles / Question / Unicursal and Route Problems
The Tube Inspector's Puzzle.
The man in our illustration is in a little dilemma. He has just been
appointed inspector of a certain system of tube railways, and it is his
duty to inspect regularly, within a stated period, all the company's
seventeen lines connecting twelve stations, as shown on the big poster
plan that he is contemplating. Now he wants to arrange his route so that
it shall take him over all the lines with as little travelling as
possible. He may begin where he likes and end where he likes. What is
his shortest route?
Could anything be simpler? But the reader will soon find that, however
he decides to proceed, the inspector must go over some of the lines more
than once. In other words, if we say that the stations are a mile apart,
he will have to travel more than seventeen miles to inspect every line.
There is the little difficulty. How far is he compelled to travel, and
which route do you recommend?
Answer
Note that there are six towns, from which only two roads issue. Thus 1
must lie between 9 and 12 in the circular route. Mark these two roads as
settled. Similarly mark 9, 5, 14, and 4, 8, 14, and 10, 6, 15, and 10,
2, 13, and 3, 7, 13. All these roads must be taken. Then you will find
that he must go from 4 to 15, as 13 is closed, and that he is compelled
to take 3, 11, 16, and also 16, 12. Thus, there is only one route, as
follows: 1, 9, 5, 14, 8, 4, 15, 6, 10, 2, 13, 7, 3, 11, 16, 12, 1, or
its reverse--reading the line the other way. Seven roads are not used.