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

by : $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.


 * Dudeney-Modern-Puzzles-159.png


 * 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?