One walk. Every bridge once. Can you do it?
1 See the graph inside the map
Each island is a vertex. Each bridge is an edge. Two bridges stay two separate edges. A crossing without a dot is not a junction.
2 Count the bridges at each dot
Even: bridges pair up Odd: one left over
Arrive + leave,
twiceOne unpaired
bridge
In the middle of a walk, every arrival needs a departure. Only the start and finish can have an unpaired bridge.
For one connected network, count the odd dots:
0 odd dots
Solvable ? circuit
Start anywhere. Finish where you started. Revisit dots, but use each line only once.
Start at A. Trace all 3 bridges to return to A.
2 odd dots
Solvable ? trail
Start at one amber dot. Finish at the other. A and B each have 3 bridges; C has 2.
Start at A. Trace all 4 bridges to finish at B.
More than 2 odd dots
Impossible
The original Königsberg graph: 7 bridges, 4 odd dots. Four dots need to be endpoints, but one walk has only two ends. No choice of start can fix it.
One more check: is it connected?
All even, still impossible. All dots with bridges must be reachable from one another. You cannot jump between separate groups.
Explore this level's graph and solution