Question 24
The diagram shown below represents the street map of a downtown of a city. A street is a square with side length 10 m. A tourist wants to walk on the streets of this town, from his hotel (point $A$ on the map) to the town hall (point $B$). Since he wants to maximize exploring the downtown, he plans to use the longest route possible, but never passing through the same point twice. What is the longest route, in m, that the tourist can traverse?
