April 28, 2026
One puzzle, two very online moods
Building a Hamiltonian Path Puzzle
Brainy new number maze drops, and the comments instantly turn into a design fight
TLDR: A developer built a clever browser number-maze game where one line must cover every square exactly once. Commenters quickly split between showing off old-school coding side quests and arguing the game should allow easier pencil-style sketching, turning a quiet puzzle post into a usability debate.
A developer just showed off Number Trail, a homemade browser puzzle where you draw one unbroken line through every square exactly once while hitting numbered spots in order. On paper, that sounds like classy brain food. In the comments? It became a mini soap opera about what puzzle players really want.
One camp showed up like the neighborhood professor, immediately dropping a flood-fill paper, a retro-looking interpreter, compile steps, and a whole "OK, let's run" vibe. It’s the kind of comment that makes half the room whisper, "legend," and the other half ask if they accidentally wandered into a time machine. The energy was pure old-school hacker flex: less "nice puzzle" and more "here is an entire side quest."
Then came the practical pushback. Another commenter argued that if this is meant to feel like a real pencil-and-paper puzzle, players should be allowed to sketch multiple path segments and connect them later. Translation for non-puzzle addicts: they want the game to let you make partial guesses instead of forcing one perfect continuous line from the start. That kicked off the real tension—elegant challenge or annoying restriction?
So while the article itself is a neat peek behind the curtain of how a number maze gets built with plain web tools, the comments turned it into something juicier: a clash between retro code nerd show-and-tell and players begging for friendlier controls. Nothing says puzzle launch like someone posting compiler commands while someone else demands better crayons.
Key Points
- •The article presents Number Trail as a Hamiltonian-path puzzle where a player must draw one continuous line through every grid cell exactly once while visiting numbered clues in ascending order.
- •Number Trail is implemented using plain HTML, CSS, and a single JavaScript module, without frameworks or a bundler.
- •The post explains that Hamiltonian path existence is NP-complete in general, citing Richard Karp’s 1972 list of NP-complete problems.
- •For full rectangular grids, the article notes that a Hamiltonian path can always be constructed using boustrophedon (snake) traversal.
- •The puzzle guarantees solvability by placing walls only on edges not used by a known solution path, and it uses Warnsdorff’s rule as part of random puzzle generation.