Henry Ernest Dudeney/Puzzles and Curious Problems/270 - Planning Tours
Jump to navigation
Jump to search
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?
Click here for solution
Also see
- Henry Ernest Dudeney: Modern Puzzles $159$ - The Five Regiments: exactly the same puzzle as this, couched in a different scenario.
Sources
- 1932: Henry Ernest Dudeney: Puzzles and Curious Problems ... (previous) ... (next): Unicursal and Route Problems: $270$. -- Planning Tours
- 1968: Henry Ernest Dudeney: 536 Puzzles & Curious Problems ... (previous) ... (next): Combinatorial & Topological Problems: Route & Network Puzzles: $428$. Planning Tours