Trace every line once, without lifting
Water Sort PuzzlePour the colours until every tube holds just one
2048Slide and merge tiles to reach the magic number
Cat TrapTrap the cat before it escapes the board
Fold Paper to the Moon42 folds. Exponential growth, visualized
Draw a Perfect CircleOne freehand loop, scored to the percent
Tic Tac Toe3×3 or 4×4, unbeatable computer or two players
Word CrossSwipe letters and fill city crosswords
Spot the DifferenceFive changes hiding in every scene A shape made of dots and connecting lines appears. Trace every line exactly once without lifting your finger and without going over any line twice. You can pass through a dot as often as you like. When every line is covered, the level is done.
The puzzle is much older than the app. It is the Seven Bridges of Königsberg, the problem Leonhard Euler solved in 1736 and, in doing so, invented graph theory. The people of Königsberg wanted to know whether they could walk a route crossing each of the town's seven bridges exactly once. Euler proved they could not, and the reason he gave is the same rule that decides whether any level here is solvable.
Count the lines meeting at each dot. A dot with an odd number of lines is an odd point. A shape can be drawn in one stroke only if it has exactly zero or two odd points.
That is the entire theory. Every level in this game is generated and then verified against that rule before it is given to you, so nothing here is unsolvable.
Easy uses a three by three lattice, normal a four by three, and hard a four by four with diagonals in play. Levels grow denser as you clear them, from around seven lines up to twenty-six. They are generated fresh rather than hand-built, so they do not run out, and the parity check runs on every one before you see it.
Your furthest level is saved per difficulty in your own browser. There is no account, no timer and no way to lose, which makes this one of the better games here for playing while thinking about something else.
Every level is checked against Euler's rule before you see it. A shape can be drawn in one stroke only if it has exactly zero or two dots with an odd number of lines meeting there, and the generator regenerates until that condition holds.
Count the lines at each dot. If exactly two dots have an odd number, you must start at one of them and you will finish at the other. If every dot is even, you can start anywhere and will end where you began.
No. Each line can only be used once, which is the whole puzzle. You can pass through a dot as many times as you like.
It is the same problem. In 1736 Leonhard Euler proved the townspeople could not walk a route crossing all seven bridges exactly once, and the odd-point rule he derived is what decides every level in this game. That proof is generally regarded as the beginning of graph theory.
They are generated rather than hand-built, so they do not run out. Levels grow denser as you clear them, from about seven lines up to twenty-six, across three difficulty settings.
No timer, no move limit and no way to lose. Undo steps back one line at a time, so exploring a wrong route costs nothing.
Your furthest level is saved per difficulty in your own browser. No account and nothing sent to a server.