Surround every tree
A tree rules out all cells touching it horizontally, vertically, or diagonally.
Example: After placing a tree, mark each editable cell in the eight surrounding positions with a dot.
🌳 Parks: How to Play
How to play
Place a tree in every row and every column.
Each colored region must also contain exactly 1 tree.
Trees cannot touch one another horizontally, vertically, or diagonally.
Mark a cell with a dot when you know it cannot contain a tree.
A row or column number turns green when its target is met and red when it contains too many trees.
The puzzle is solved when every row, column, and region has the correct number of trees. Trees that break a rule are outlined in red.
Solving tips
Close a satisfied group
Once a row, column, or coloured region has all of its required trees, every other unknown cell in that group is not a tree.
Example: A region needs 1 tree and already contains one. Mark each remaining cell in that region with a dot.
Fill an exact fit
Count how many trees a row, column, or region still needs, then count its unknown cells. If the numbers match, every unknown cell is a tree.
Example: A row needs 2 more trees and has exactly 2 cells that are not dotted. Place a tree in both cells.
Find the last possible cell
If a row, column, or region still needs one tree and only one cell remains possible, that cell must be a tree.
Example: A region needs one tree and all but one of its cells are dotted. Place the tree in the remaining cell.
Lock a region into a line
If every remaining tree position in a region lies in the same row or column, that line must receive the region’s remaining trees there.
Example: A region still needs one tree and all its possible cells are in row 4. If row 4 also needs only one tree, dot every row-4 cell outside that region.
Use shared no-touch cells
When a group’s remaining tree must be in one of two nearby cells, any cell touching both candidates cannot contain a tree.
Example: A region has two side-by-side candidates for its last tree. Dot the cells directly above and below the pair because either choice would touch them.
Count separated spaces
Trees in the same row or column need at least one cell between them. Split the remaining candidates into groups that cannot share a tree.
Example: A row needs 2 trees and its candidates form exactly two separated groups. Each group must contain one tree.
Recheck all three groups
Every tree changes a row, a column, and a coloured region at the same time. Recount all three after each certain placement.
Example: A new tree may finish its column; dotting that column can then leave another region with only one possible cell.