Math Puzzle: What number of roots can you discover?
Resolve the Touring Salesman’s Directional Dilemma
Henry Ernest Dewdney might be probably the most necessary puzzle inventors of all time. He was born in Mayfield, England in 1857, the son of a village schoolteacher, and died in 1930. Dewdney designed common mind teasers for newspapers and magazines for many years, and later compiled most of his puzzles into books. This brain-teaser is taken from his guide, revealed in 1917. Math Enjoyable.
A touring salesman dwelling in metropolis A plans to go to all cities from metropolis B to metropolis P (not essentially in alphabetical order) over the course of every week, earlier than returning to metropolis A. He plans to enter every metropolis solely as soon as. The blue strains are the one roads connecting the 16 cities. The touring salesman can solely journey between any two cities in a straight line route; he can not flip on the intersection of two roads. What number of attainable routes are there?
Supporting science journalism
In case you loved this text, please help our award-winning journalism. Subscribe. By buying a subscription, you assist guarantee a way forward for influential tales in regards to the discoveries and concepts shaping the world right this moment.
If a touring salesman enters a metropolis on one street, he should depart it once more on one other street. To make a spherical journey attainable, a minimum of two roads should result in every metropolis. There are precisely two roads resulting in cities A, B, E, F, G, and H. Due to this fact, the touring salesman should take these roads in any case. This determines which roads he should use to reach and depart from cities I, J, M, and N. The remaining connections are additionally clear. Thus, the touring salesman could make just one spherical journey (AIENHDOFJBMGCKPLA), however he can journey in two completely different instructions.
Editor’s observe: The model of the puzzle that appeared in our July/August 2024 print concern incorrectly contained connections between C and I, and between I and M. This error didn’t have an effect on the answer.
