Netwalk, FreeNet and Net: What the Sources Establish
Published . Rewritten and corrected .
Correction: An earlier version presented an unsupported story that Netwalk began in the GNOME Games collection and evolved from a system administrator's tool. We could not substantiate that account and have withdrawn it. This article now separates documented project relationships from the behavior of this independent website. It is not a definitive chronology of every game using the Netwalk name.
A documented connection: FreeNet and Simon Tatham's Net
In the Net manual, Simon Tatham identifies Pavils Jurjans' Flash game FreeNet as the version he first encountered. He also notes other implementations named NetWalk. That documents his stated inspiration; it does not establish which implementation was first, date the invention of the puzzle, or prove that every later version shares one codebase.
The manual describes a connected network without closed loops. It explains wrapped edges and an option that normally enforces a unique solution. These are useful reference points when reading a tutorial, because a rule that belongs to one implementation should not silently be assumed to apply to another.
KNetWalk is a separate project worth identifying precisely
The official KDE application page describes KNetWalk as a single-player network-rotation game. Its instructions require connecting clients to the server with no unconnected wires. It documents left- and right-click rotation and a middle-click marker that prevents an accidental turn until unblocked.
Those instructions describe KNetWalk, not this site's controls. Naming the project and linking its own documentation is more useful than treating similar titles as interchangeable. Neither the KDE page nor the Net manual cited here supports the former GNOME-origin narrative.
What this browser implementation actually does
On playnetwalk.com, clicking rotates clockwise. Bounded and Torus use a tree network; Torus treats opposite edges as neighbors. Classic can include loops and fixed clues. Every mode requires matching pipe openings and connectivity to the server. The server is a connection reference, not a guarantee that its initial rotation is correct.
That last distinction matters in practice. A player arriving from a game where a tile marker is user-controlled may expect to lock a deduction here. The fixed clues in this site's Classic mode are instead supplied by the generator. Our instructions should describe that behavior directly, rather than borrow a control description from another Netwalk implementation.
The generator stores a solved arrangement and then rotates its pieces. Restoring those pieces demonstrates a solution. It does not demonstrate that only one solution exists or that a player can find it using local deductions alone. Our implementation has no uniqueness filter comparable to the option documented for Tatham's Net.
Why the September correction belongs in this account
Our former Bounded and Torus generator changed tile degrees after building a tree. Those edits conflicted with the no-cycle completion rule. On September 14 we removed the edits, added restoration tests and tightened the completion check to reject unmatched openings. The generation guide records the reproduction and its limits.
This is an implementation change on this website, not an event in the origins of the puzzle. Keeping those categories separate prevents a local bug fix from being presented as a historical fact about other projects. It also helps returning players understand why an old Daily board or local best score may not match the current version.
How to compare two versions before following advice
- Check whether opposite boundaries connect. Corner deductions change completely on a wrapped board.
- Read the completion rule. Connectivity, matching openings and loop restrictions are separate conditions.
- Check what a lock means: a supplied clue, a personal marker, or an unavailable feature.
- Check whether a shared seed includes the mode and software version. Matching a date alone is not enough across different implementations.
These questions give the reader a practical reason to distinguish projects without requiring a speculative origin story. Begin with our interactive three-lesson tutorial, then compare its explicit Bounded rules with whichever implementation you want to play. If a rule differs, use that project's own manual as the authority for that game.
Sources checked September 14, 2026. This independent website claims no endorsement by KDE, Simon Tatham, or Pavils Jurjans. If you can supply a primary source that establishes an earlier history, use the contact information on our About page; corrections should add evidence, not replace one unsupported timeline with another.