1. The Königsberg Bridge Problem
In the early 18th century, the citizens of Königsberg — a city in what is now Russia — posed a question that seemed trivially simple: was it possible to walk through the city, crossing each of its seven bridges exactly once? You could start and end anywhere you liked. You just could not cross any bridge more than once.
People tried for years. No one could do it. But no one could prove it was impossible, either. Then in 1736, the Swiss mathematician Leonhard Euler published a paper that settled the question forever — and in doing so invented an entirely new branch of mathematics: graph theory.
Euler's insight was to strip away everything that did not matter. It did not matter how long the bridges were, where exactly they were located, or what else was in the city. What mattered was only this: which land masses were connected to which other land masses, and how many bridges connected them. He replaced the map with an abstract diagram — a graph — and analysed the structure of connections.
His conclusion: the walk is possible if and only if the graph satisfies a specific mathematical condition. Today every TraceBlazer puzzle is designed around that condition, which is why understanding it is the most powerful piece of knowledge you can bring to the game.
Historical note
The seven bridges of Königsberg crossed the Pregel River to connect two islands and two river banks. Euler proved that no such walk existed in Königsberg. The city was later renamed Kaliningrad, and two of the bridges were destroyed in World War II — which actually makes an Euler walk possible on the remaining five. History changed the puzzle.
2. Graph Theory Basics
A graph in mathematics is not a bar chart or a pie chart. It is a collection of nodes (also called vertices) connected by edges (also called links). If you think of cities on a map connected by roads, you have a graph: cities are nodes, roads are edges.
The degree of a node is the number of edges directly connected to it. A city with three roads leading out of it has degree 3. This number — the degree of each node — is the single most important piece of information when solving a one-stroke puzzle.
Even-degree node
A node where an even number of edges meet (2, 4, 6…). You can enter and leave this node as many times as you like without getting stuck, as long as you enter and exit the same number of times.
Odd-degree node
A node where an odd number of edges meet (1, 3, 5…). Every time you enter this node, you use one edge. The total number of arrivals and departures is unequal — which means the path must either start or end here.
This asymmetry is the key. If a node has an odd number of edges, it cannot be a pure "pass-through" node — it must be the place where your path starts or ends. This single observation is the foundation of everything Euler proved.
3. Euler's Theorem — The Solvability Rule
The theorem, in plain English:
- ✓If a connected graph has zero odd-degree nodes, a complete one-stroke path exists and you can start from any node. You will also finish at the same node you started — the path forms a closed loop. This is called an Eulerian circuit.
- ✓If a connected graph has exactly two odd-degree nodes, a complete one-stroke path exists but you must start at one odd-degree node and finish at the other. This is called an Eulerian path.
- ✗If a connected graph has four or more odd-degree nodes, no complete one-stroke path exists. The puzzle is unsolvable. (All TraceBlazer puzzles are designed to be solvable, so you will never encounter this case.)
Notice that the number of odd-degree nodes must always be even (it can be 0, 2, 4, 6…). This is a mathematical fact: in any graph, the number of nodes with an odd degree is always even. So the only case where a full traversal is possible is when that number is 0 or 2.
The Königsberg bridges produced four odd-degree nodes — one for each land mass, because each had an odd number of bridges connected to it. Four odd-degree nodes means no Euler path exists. That is why no one could ever solve the Königsberg walk, no matter how clever they were or how long they tried. The answer was not just "hard" — it was mathematically impossible.
Before you touch a TraceBlazer puzzle, spend two seconds counting the odd-degree nodes. If you count exactly two, you know immediately that those two nodes are your only valid starting and ending points. This eliminates all the trial and error of guessing where to begin.
4. How to Choose Your Starting Node
Knowing which nodes are valid starting points is one thing. Choosing which valid starting point to use is a different skill entirely — one that separates fast solvers from slow ones.
When there are two odd-degree nodes
You have no choice of where to start — only two nodes are valid, and you must begin at one and finish at the other. The strategic decision is which of the two to start at. Generally, start at the odd-degree node that is nearest to the most "dense" part of the graph — the cluster of edges that would be hardest to exit gracefully if you entered from the wrong direction.
When all nodes have even degree (Eulerian circuit)
Any node can be a valid starting point. This sounds liberating but is actually harder, because there are more possible wrong moves. A good rule: look for natural entry points into the most connected region of the graph, and start at a node that will give you a clear "outward spiral" path through the graph.
Look for dead ends and peninsulas
A node with only one edge (degree 1) is always odd. It must be a start or end point, and your path can only go in and immediately come back out once you arrive. Identify these degree-1 "dead end" nodes early — they force your hand and narrow your choices significantly.
5. Six Strategies for Complex Graphs
Knowing Euler's theorem tells you whether a puzzle is solvable and where you can start. But on a complex graph with 15 nodes and 30 edges, you still need a plan for how to navigate. Here are six strategies that expert players use.
Bridge detection
A bridge is an edge whose removal splits the graph into two disconnected parts. Never cross a bridge unless you have no other option — because once you do, you are committed to finishing on that side of the graph. If you cross a bridge and leave unvisited edges on the other side, you are stuck. Identify bridges visually as the "thin" connections between clusters.
Avoid trapping sub-graphs early
The most common mistake at any level is visiting one dense cluster of nodes too early, then leaving via the only exit, and later having to re-enter — which forces you to retrace an edge. Whenever you see a cluster connected to the rest of the graph by only one or two edges, plan to visit it last, entering and exiting in a single sweep.
Follow the outer ring first
For circular or square-shaped graphs, tracing the outer perimeter first gives you maximum flexibility. The centre of the graph usually has more connections (higher-degree nodes), which means you can enter and exit it in any order — so save it for later, when the outer ring is already complete.
The zig-zag pattern for grids
Grid-shaped puzzles (rows and columns of nodes) respond well to a systematic row-by-row approach. Traverse one row left-to-right, step down to the next row, traverse right-to-left, step down again, and continue. This "boustrophedon" (ox-plowing) pattern covers all horizontal edges efficiently. You will need to adjust for the vertical connections, but the row sweeps give you a solid base.
Use undo, not restart
In Classic Mode, the undo button lets you step back one edge at a time. When you hit a dead end, resist the urge to restart from scratch. Instead, undo three or four moves to find the last decision point where you had a meaningful choice, and try the other option. The puzzle rarely requires you to go all the way back to the beginning — the error is usually just a few moves behind you.
Visualise the end before the middle
Work backwards from the finish as well as forwards from the start. If you know your path must end at a particular node (because it is the only odd-degree node you have not started at), ask yourself: what edges lead into that node? Which edges will I need to have already covered by the time I arrive? Planning the last three moves of your path backward from the end often unlocks the right route through the entire graph.
6. Taking It Further: Hack Mode and Spatial Memory
TraceBlazer's Hack Mode introduces an extra layer of challenge: the puzzle graph is shown clearly for three seconds, then it warps and partially obscures itself. You must complete the Euler path from memory.
Mastering Hack Mode requires a different kind of preparation. During the three-second preview, you do not have time to analyse the graph in detail — you need to extract the most important structural information as quickly as possible.
Memorise structure, not positions
Your brain retains the topology of a graph (which things connect to which) far better than exact coordinates. Focus on understanding the shape of the graph: Is it a loop? Does it have branches? Are there clusters? Try to build a verbal description in your head: "big ring with a cross through it" or "three triangles sharing a common edge."
Spot the odd-degree nodes immediately
In your three-second preview, the single most valuable thing you can identify is the odd-degree nodes. Count them. Note whether there are zero or two. If two, note their approximate positions — these are your mandatory start and end points, and that information survives the warp better than precise layout details.
Commit to a starting plan
Before the graph distorts, decide where you will begin — not just in principle, but the exact first three moves. Having a committed plan eliminates the paralysis of standing at the starting node wondering which direction to go. If your initial plan does not work out, you can adapt — but starting with a plan is faster than starting without one.
Build up with Classic Mode first
Hack Mode is not the place to learn graph-reading. Every hour you spend in Classic Mode, consciously practising the strategies above, improves your Hack Mode performance. The faster you can derive a route in Classic Mode, the more confidently you can lock in that route during the three-second preview in Hack Mode.
7. Where to Practise
Reading about Euler paths is a good start. Playing them is better. Here is the best progression for building genuine skill from zero to expert level.
Start here. No time limit. Work through the early levels slowly, counting odd-degree nodes and consciously applying the bridge-detection and sub-graph strategies. The goal at this stage is not speed — it is building intuition for how graphs behave.
Once you are comfortable with Classic Mode up to level 10, add the Daily Challenge to your routine. Every player sees the same puzzle, which means the leaderboard is a true skill comparison. Compare your solve time against the global average to calibrate your progress.
When you can solve Classic Mode puzzles at your current level without using undo more than once or twice, try Timebreaker. The timer forces you to plan ahead rather than explore, which builds the rapid graph-reading skill that carries over to Hack Mode.
Multiplayer adds the psychological pressure of competing in real time. Hack Mode tests your spatial memory. Both are the proving grounds for everything you have built in the earlier steps. Players who reach the top of the multiplayer leaderboard have typically logged hundreds of hours in Classic and Timebreaker first.
The Daily Challenge is the single best practice tool for intermediate and advanced players. Because the puzzle resets every day, you build breadth — exposure to many different graph shapes — rather than depth on a single puzzle. After 30 days of consistent daily play, most players report a significant improvement in how quickly they can identify a valid Euler path.
Quick Reference
| Situation | What to do |
|---|---|
| 0 odd-degree nodes | Start anywhere. Path will form a loop back to start. |
| 2 odd-degree nodes | Must start at one odd node and end at the other. |
| 4+ odd-degree nodes | Puzzle is unsolvable (TraceBlazer never produces these). |
| Degree-1 node spotted | That node is a dead end — must be start or end. |
| Bridge spotted | Cross it only as a last resort to avoid getting trapped. |
| Dense cluster visible | Save that cluster for last; enter and sweep it clean. |
| Stuck / hit dead end | Use undo, not restart — step back to your last decision. |
Ready to Apply What You've Learned?
TraceBlazer is free to play in your browser with no download required. Start with Classic Mode to practise Eulerian path strategies at your own pace.