Tap between two cells to cycle link → ✕ → clear.
A distance clue can't always tell two equally near neighbours apart, so the puzzle isn't really asking for one particular tree — it's asking for the pattern of distances that tree produces. Any tree that reproduces those distances is a solution; where a real choice remains, every choice is valid.
One fact worth knowing: a cell's distance from the root always shares its chessboard colour's parity, and is never less than the direct number of steps to the root.
RULES The filled cell is the root, at distance 0. Each numbered cell's distance from the root, along your links, must equal its number. Link every cell into one connected tree. No loops, no points left out. Where two neighbours are equally close to the root, the choice of parent is yours. CONTROLS Tap between two cells to cycle link → ✕ → clear. EASY 5×5 MEDIUM 6×6 HARD 7×7
CHECK SHOW SOLUTION CLEAR Related: Nurikabe , another connectivity puzzle, growing a sea instead of a tree, and Kirchhoff , another puzzle whose feasibility is a graph computation rather than a search.