Pitch exactly one tent next to every tree, keep the tents from touching, and make the numbers around the grid come out right.
Tents is a logic puzzle on a grid dotted with trees. Your job is to place tents so that each tree gets exactly one tent pitched in an orthogonally adjacent cell, and every tent pairs with exactly one tree. The numbers along the edges tell you how many tents belong in each row and column.
Tents is a puzzle type with no documented first appearance, circulated widely enough in collections and software that its origin has simply not been recorded.
Structurally it is a matching problem dressed as a picture. Every tree must be paired with exactly one tent in an orthogonally adjacent cell, and every tent with exactly one tree — a one-to-one correspondence, which is a different demand from the counting that drives most grid logic puzzles.
The edge numbers then layer a counting constraint on top of the matching, and the no-touching rule keeps tents from clustering. The result is that a tree with several plausible neighbours usually cannot be resolved on its own — it is decided by what some distant row total forces elsewhere.
Tents (sometimes called Tents and Trees) is a one-solution deduction puzzle that blends adjacency and counting rules into a satisfying logical chain. This is an original, free browser version with daily and practice modes, playable instantly with no download or sign-up.