It's time to drag the Island of Knights and Knaves kicking and screaming into the 19th century! We're going to run a train. For these puzzles, you'll have a set of stations with possible connections, and you need to find a route that starts at one station, goes through every other station exactly once, and ends in a station. IE if our map was
A -- B -- C
| | |
D -- E -- F
Valid routes might be A B C F E D
, or A D E B C F
, but A B E D C F
is invalid. The ordering matters: A B C
is a different route from C B A
.