Start at a valid node and move along unused edges. You cannot traverse the same edge twice. Completing all edges finishes the puzzle; getting stuck with unused edges remaining fails the attempt.

Mathematically, connected graphs have an Eulerian path when exactly zero or two vertices have odd degree. Levels are generated to be solvable; your job is to find the route under time pressure.

Faster completions and harder graphs score higher. Dead-end restarts cost time. Optional streaks reward consecutive clears without mistakes.

Count odd-degree nodes first — start at an odd vertex when two exist. Save bridges (edges whose removal would split remaining work) for last. Mentally mark forced corridors before clicking.