Question 4
The diagram shows a map of 23 towns connected by roads, with a video arcade in each town. Andy, who loves playing video games, works in an office in town $O$. Every day after work, he visits all the towns exactly once to play before reaching his home in town $H$. He spends much of his free time at the arcades and is ignoring his girlfriend. One day she decides to meet him on his way home, but he varies his routes all the time. She has discovered that there is one road he must pass along in every possible route, so she plans to wait for him on it. Which road is it?
The answer sheet also asks you to draw one possible route and name the two towns at the ends of the road. No partial score.
The answer sheet also asks you to draw one possible route and name the two towns at the ends of the road. No partial score.