Connect matching nodes across the topological grid.
Solve the built-in campaign levels.
Design, customize, and save your own grids.
Manage, share, and track your solutions.
Publish grids, unlock invite-only groups, and test community creations.
Design custom paths for different tile geometries.
Explore the combinatorics and topology behind easy, hard, and impossible grids.
Continue the campaign, or generate a fresh board with your chosen geometry and difficulty.
Play the built-in curated levels exactly as before.
Use the default tiles for a generated board. Choose the geometry, layers, pairs, and difficulty from a dedicated random panel in the game view.
A mathematical lens on size, structure, solvability, and why local tile rules transform global difficulty.
Core idea
Size alone does not determine difficulty. A larger board can be easier if it creates more routing slack, more alternate corridors, or fewer forced collisions. A smaller board can be brutal when a handful of local choices controls the entire network.
In other words, hardness often comes from structure, not scale: bottlenecks, endpoint ordering, symmetry, local rigidity, and how much freedom each tile preserves for the rest of the puzzle.
Before asking for the best route, ask whether any valid route exists at all. Boundary placement, disconnected regions, narrow bottlenecks, and forced pairings can make a puzzle impossible before the search truly begins.
Which local constraints would let you prove impossibility before doing a full search? Which bottlenecks or disconnected regions behave like instant certificates of failure?
Some grids collapse to a single rigid routing. Others admit many valid completions. Counting solutions tells us how constrained a puzzle really is, and whether the challenge comes from logic, exploration, or ambiguity.
What changes turn a rigid grid into one with many valid completions? Could you estimate the number of solutions from symmetry, branch points, or corridor width before enumerating every route?
Among all valid routings, which one is the cleanest? Simplicity might mean fewer turns, fewer detours, more symmetry, or more natural pairings. The simplest solution is not always the one that is easiest to discover.
How should simplicity be measured: fewest turns, shortest total path length, strongest symmetry, or the most balanced pairing pattern? Different metrics may prefer very different “best” solutions.
The key issue is flexibility. A two-path tile makes each placement a strong commitment, and those commitments propagate across the board. A three-path tile changes the global behavior because it introduces more slack, more rerouting options, and fewer brittle dead ends.
Where does extra connectivity stop being “more complexity” and start becoming “more freedom”? Which board shapes or endpoint patterns make a two-path tile set especially brittle?
Which of these questions could become small experiments inside the editor or community grid space? A good theory board can seed concrete puzzles, counterexamples, and shareable conjectures.
Manage grids, retrieve saved progress, and view solutions.
localStorage.Choose between the sharing tools and the dedicated community grid library.
Publish Repository grids, manage invite-code access, and control who can see private community posts.
Browse the full library of community grids, test them, save your own progress into Repository, and join the threaded discussion.
Browse stored community grids, test them with their custom tiles, and open the threaded discussion on each card.
All paths perfectly routed.
Configure grid → drag letters to boundaries → save to repository
Design custom routing logic for any geometry.
Drag tiles onto 🗑️ to delete them permanently.