⛺ Tents & Trees
🧩 Logic · 1 playsTents & Trees
Pitch one tent beside every tree, with no two tents touching.
About Tents & Trees
Each tree in the grid has exactly one tent, placed directly above, below, to the left or to the right of it, and each tent belongs to exactly one tree. No two tents may touch, not even at a corner, and the numbers along the edges give the tent count for each row and column. A line marked zero is the most valuable clue on the board, because clearing it often leaves some tree with a single square to its name. What trips people up is the pairing: a tent standing between two trees still only accounts for one of them, so the bookkeeping matters as much as the placing.
How to Play
Tap a cell once to pitch a tent, and again to mark it as grass. Every tree has exactly one tent orthogonally beside it, and every tent belongs to one tree. Tents may not touch, diagonals included. The edge numbers count the tents in that row or column.
💡 Tips & Strategy
The one-neighbour rule opens every puzzle. Any tree with just a single free cell beside it must have its tent there — so look for trees hemmed in by edges, by other trees, or by grass you have already marked. Each tent placed then blocks all eight cells around it, which frequently creates the next forced tree.
Mark grass aggressively. Every cell not orthogonally adjacent to any tree can never hold a tent, and filling those in early makes the remaining geometry far easier to read. A row whose count is 0 clears in one pass and often forces tents in the columns that cross it.
The row and column numbers behave like a nonogram. When a line's remaining candidate cells exactly equal its outstanding tent count, all of them are tents; when its count is already satisfied, everything else in the line is grass. Alternate between line counting and the adjacency rules.
Late on, think in pairs. Tents and trees match one to one, so if a group of trees can only reach a group of the same size, those cells are all tents — and if two trees compete for a single cell, at least one of them must use another neighbour, which usually resolves both.