• Game 03 of 10
  • 3–6 min
  • Procedural
  • New every day

thread

A grid with a marked start and end. Draw a single unbroken path that visits every cell exactly once. Arrows along the way tell you which direction the path must be travelling as it passes.

How a round plays

One path. Every cell. No crossings.

  1. Start on the marked cell and move to any neighbour.
  2. Every cell must be used once, and only once.
  3. Finish on the end cell with nothing left over.

Scoring and fairness

What the grade is measuring.

The ◆ grade. Whether you found it, and how many attempts you spent getting there.

Hints.Extends your path along the correct route by one more cell. Using one keeps you off the ranked board for that day, so a hint can rescue a round but never buy a rank.

How the result is proved.Server-graded answer. Every one of the ten games is verified server-side in one of three ways — a replayed move log, a server-graded answer, or per-guess checks that end in a signed win token — so the leaderboard only counts results the server could reconstruct for itself.

  • Verification: Server-graded answer
  • Puzzle source: Procedural
  • Typical round: 3–6 min

Where it comes from

A new one, every night.

Tomorrow's thread already exists. It was generated from a date seed, checked by a solver, and put in a queue that runs weeks ahead of today — so nothing ships the night it was made, and a bad batch never reaches a player.