Drag one road from β through every town. Rivers can only be crossed on bridges, the way the arrow points. Landmarks in number order.
The map is folded away. Clock's stopped.
β’ Start on landmark β and drag through neighbouring towns (no diagonals).
β’ Visit every town exactly once.
β’ Blue rivers block you β except at a wooden bridge, which only goes the way its arrow points.
β’ Reach landmarks β‘, β’β¦ in order.
β’ Drag backwards to undo. Keyboard: arrows, Backspace.
Most maps have more than one valid route. After you solve it, see how many travellers took the same road as you.