You cannot move or swap pipe tiles in Pipes Puzzle: every one of the nine pipe tiles stays locked in its 3 by 3 cell, and the only legal action you can take on a tile is to rotate it 90 degrees clockwise. This rotation-only rule comes straight from the Net-style connection-game family that Pipes Puzzle belongs to, where the tile layout is fixed and only the openings on each tile need to be oriented correctly. The board renders each tile as text line glyphs that represent up, right, down, and left openings, and rotating a tile shifts every opening clockwise while keeping the tile's position and the count of openings on the tile unchanged. Because tile positions never change, the puzzle reduces to a deterministic orientation problem with one disclosed solved network: nine vertices connected by exactly eight reciprocal edges in one unified acyclic network, reachable from the disclosed scramble by 18 clockwise rotations.
What You Can and Cannot Do to a Pipe Tile
Each of the nine cells in Pipes Puzzle holds a fixed pipe tile, and that tile never leaves its assigned row and column. Tiles stay in their positions but can rotate in 90-degree steps, and every rotation preserves the number of openings the tile started with. The board draws each opening bit using one of four text line glyphs: up, right, down, and left. When you rotate a tile clockwise, every opening on that tile shifts one step clockwise around the mask, which means a tile with a single opening produces four possible orientations and a tile with two openings produces only the orientations that match its pipe shape.
Movement, dragging, swapping, and tile exchange are intentionally disabled. There is no inventory of spare tiles, no slot you can drop a tile into, and no way to reorder the 3 by 3 grid. If you are used to sliding numbered tiles around a board like in 15 Puzzle, that instinct does not apply here. The puzzle only changes orientation, never arrangement. For a direct comparison of a similar rule question in another puzzle, the Klotski guide on whether pieces can rotate or move more than one cell explains the sliding-block version of the same boundary between move and reorient.
Why Pipes Puzzle Locks Tile Positions
The rotation-only design is not an arbitrary choice. Pipes Puzzle is a compact version of the connection game also known as Net, FreeNet, or NetWalk, and the rule contract follows Simon Tatham's maintained Net documentation. Tatham describes a shuffled network restored by rotating tiles until it is entirely connected with no closed loops, and that description fixes the geometry before any orientation work begins. An independent Puzzolve guide reinforces the same five properties: reciprocal openings between neighbors, one unified network, no boundary-facing openings, rotation without movement, and an acyclic tree structure.
Because the puzzle defines both the tile layout and the scramble rotations in advance, completion is reproducible. Pipes Puzzle uses a fixed 3 by 3 snake fixture, and the disclosed solved network threads across the top row, down the right side, back across the middle, down the left, and across the bottom. That network contains nine vertices and eight reciprocal edges, which matches the exact edge count of a connected acyclic tree. Reversing the initial one, two, three-turn scramble takes 18 clockwise rotations and earns 820 points from a starting value of 1,000. None of that would be possible if tile positions could shift, because the scramble and the solution both assume the same nine cells. Simon Tatham's Net documentation describes this orientation-only restoration in full.
How to Rotate the Tiles Until the Network Connects
- Move the cursor with the arrow keys to the pipe tile you want to orient. The cursor stops at board edges and never wraps around the grid.
- Press Space or Enter to rotate the selected tile clockwise by 90 degrees. Each press shifts every opening on that tile one step clockwise without moving the tile from its cell.
- If you use a mouse or touch device, click a tile directly to rotate that same tile clockwise. Clicking is equivalent to selecting the tile and pressing Space.
- After each rotation, check the status line for the loose-end count and the number of cells connected to the first tile. A loose end is an opening pointing outside the grid or facing a neighbor that does not open back toward it.
- Keep rotating individual tiles until the status line reports zero loose ends, all nine tiles reached, and exactly eight reciprocal edges with no cycle. At that point completion freezes rotations to keep the final result stable.
- Press Restart if you want to restore the scramble, the cursor position, the score, the move count, and the live analysis back to the start of the run.
The Four Checks That Confirm a Solved Board
Validation runs after every rotation, so you receive feedback on each click rather than only at the end. For every opening on every tile, the browser calculates the neighboring row and column based on the opening bit. There are four checks you can read from the status line and from the rules engine. The first two detect mismatches and loose ends, and the last two enforce the network shape so that a board with all openings matched but a stray loop still counts as unsolved.
| Validation check | What it detects | Effect on the run |
|---|---|---|
| Outward opening | An opening points to a row or column outside the 3 by 3 grid | Counts as a loose end on the status line |
| Reciprocal mismatch | An opening faces a neighbor whose opening bit does not point back | Counts as a loose end on the status line |
| Connectivity gap | Breadth-first traversal from the first tile cannot reach all nine cells | Status line reports fewer than nine connected tiles |
| Cycle in the adjacency graph | A disjoint-set union finds two vertices already in the same component | Solution is rejected even if every opening matches |
An unsolved board is explicitly detected as a deadlocked orientation, but the tiles remain editable because rotating another tile can repair the network. A rotation does not destroy prior progress; it only re-evaluates the graph from scratch. Completion requires zero mismatches, all nine tiles reached, exactly eight edges, and no cycle. Automated tests cover tile rotation without movement, reciprocal edges, outward openings, all-nine connectivity, the eight-edge invariant, cycle prohibition, up-to-right rotation, fixed table sizes, the initial deadlock, and the full 18-rotation completion sequence.
Score, Restart, and the Boss Key Shortcut
Pipes Puzzle uses a transparent scoring formula that rewards fewer rotations. The score is computed as max(0, 1000 minus 10 times rotations), starting from a base of 1,000. For the disclosed scramble, that means a single worked calculation: 1000 minus 10 times 18 equals 1000 minus 180, which equals 820 points. If you need more rotations to repair an early mistake, each extra rotation subtracts 10 points from the total, and the score never goes below zero. A completed best score may be stored only in localStorage, so the result never leaves your browser and there is no server call to publish the score.
Restart restores all nine scramble rotations, the cursor position, the score, the move count, and the live analysis back to the starting state. The boss key is a double Escape: press Escape twice within 400 milliseconds to cover the puzzle with the shared simulated operations spreadsheet, then repeat the double press to return to the unchanged network. The board uses Lizely CSS variables for its surface, lines, foreground, accent, and focus states, and there is no canvas, animation loop, sound, downloaded art, or random generator. Each tile exposes its index and current opening mask to assistive technology, and the selection has a visible outline for screen readers and keyboard users.
Other Connection Puzzles Worth Trying
Pipes Puzzle is one of several connection-style puzzles that share the network-completion goal. If you enjoy orienting tiles until every opening matches, try Numberlink, which connects pairs of matching numbers with continuous orthogonal paths while avoiding reused cells and branches. Hashi Bridges connects numbered islands with non-crossing single or double bridges until every clue is satisfied and the whole island set forms one network. For a number-based shading variation, Hitori shades repeated numbers from a five by five grid while keeping black cells apart and the remaining white cells connected, and Tents Puzzle pairs trees with tents while matching every row and column clue.
Treat Pipes as a short spatial-network challenge rather than a measure of ability or attention. The fixed 3 by 3 board, the disclosed scramble, and the rotation-only contract mean every run is reproducible, so you can return to it as a calm logic exercise rather than a graded test. The validation feedback and the status line both update after each rotation, which makes the puzzle a useful sandbox for experimenting with network constraints: change one tile, watch the loose-end count move, then keep adjusting until the graph becomes a single acyclic tree of nine vertices and eight edges.