Net
Why is my Net network connected but not solved?
Every tile must belong to one network, and that network must contain no closed cycle. Check connections away from the highlighted centre too. A connected branch can still be part of a forbidden loop.
Worked example
Four elbow tiles arranged as a closed square make a loop. Connecting that square to the rest of the board does not remove the loop.
What to check on your board
Apply the rule above to your current board, then verify the remaining puzzle constraints. The example explains a local deduction; it is not a solution to every randomly generated board.
Checking your next move
Trace a branch until it ends or returns to a tile you already visited. If it returns, fix that loop before trying to connect more tiles. Then start from the centre and check that every remaining branch can be reached; connectivity and the absence of loops are two separate checks.
Using this reference
For Net, read the rule and the worked example together before opening the game. Separate what the rule explicitly requires from what only seems likely on the current board. A useful next move is one you can explain from the visible constraints, not merely a pattern that looks familiar.
If you get stuck, isolate a smaller part of the position and list what is still possible there. After a move, check the affected rows, regions or connections again. The reference explains the documented rules; progress, controls and save behavior belong to the linked game.
Read the developer’s manual ↗ · Open the developer’s browser version ↗
Manual inspected: · Simon Tatham & contributors · MIT