Henry Ernest Dudeney/Puzzles and Curious Problems/270 - Planning Tours/Solution

Puzzles and Curious Problems by Henry Ernest Dudeney: $270$

Planning Tours

The diagram represents a map (considerably simplified for our purposes) of a certain district.

The circles and dots are towns and villages, and the lines roads.

Can you show how $5$ motor-car drivers can go from $A$ to $A$, from $B$ to $B$, from $C$ to $C$, from $D$ to $D$, from $E$ to $E$, respectively,

without ever crossing the track or going along the same road as another car?

Solution

Sources

• 1932: Henry Ernest Dudeney: Puzzles and Curious Problems ... (previous) ... (next): Solutions: $270$. -- Planning Tours
• 1968: Henry Ernest Dudeney: 536 Puzzles & Curious Problems ... (previous) ... (next): Answers: $428$. Planning Tours