Henry Ernest Dudeney/Puzzles and Curious Problems/266 - Railway Routes
Jump to navigation
Jump to search
Puzzles and Curious Problems by Henry Ernest Dudeney: $266$
- Railway Routes
- The diagram below represents a simplified railway system,
- and we want to know how many different ways there are of going from $A$ to $E$, if we never go twice along the same line in any journey.
- This is a very simple proposition, but practically impossible of solution until you have hit on some method of recording the routes.
Click here for solution
Sources
- 1932: Henry Ernest Dudeney: Puzzles and Curious Problems ... (previous) ... (next): Unicursal and Route Problems: $266$. -- Railway Routes
- 1968: Henry Ernest Dudeney: 536 Puzzles & Curious Problems ... (previous) ... (next): Combinatorial & Topological Problems: Route & Network Puzzles: $424$. Railway Routes