Solution

(related to Problem: The Union Jack)

There are just sixteen points (all on the outside) where three roads may be said to join. These are called by mathematicians "odd nodes." There is a rule that tells us that in the case of a drawing like the present one, where there are sixteen odd nodes, it requires eight separate strokes or routes (that is, half as many as there are odd nodes) to complete it. As we have to produce as much as possible with only one of these eight strokes, it is clearly necessary to contrive that the seven strokes from odd node to odd node shall be as short as possible. Start at $A$ and end at $B,$ or go the reverse way.

a240


Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs
non-Github:
@H-Dudeney


References

Project Gutenberg

  1. Dudeney, H. E.: "Amusements in Mathematics", The Authors' Club, 1917

This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this edition or online at http://www.gutenberg.org. If you are not located in the United States, you'll have to check the laws of the country where you are located before using this ebook.