How to play Tents and Trees Puzzle
Take a little time to learn the rules. Every move gets clearer with practice.
Place tents beside trees, follow the row and column clues, and build a peaceful little campsite. This guide explains the rules and the decisions that matter while you play.
Play Nineleaf Tents →How to play Tents and Trees Puzzle
- 01
Pair every tree with one tent in a horizontally or vertically adjacent cell.
- 02
Every tent belongs to one tree, with a valid one-to-one pairing overall.
- 03
Tents must not touch, including at a diagonal corner.
- 04
Row and column clues give the exact number of tents in each line.
Tents and Trees Puzzle: player questions
Can a tent sit diagonally beside its tree?
No. A tree and its assigned tent must share a horizontal or vertical edge.
Can two tents touch at a corner?
No. Tents cannot share an edge or a corner. Keep the eight neighboring cells around a placed tent free of other tents.
Can a tent be next to more than one tree?
It can, provided all trees and tents can still be paired one to one. Adjacency alone does not establish which tree owns it.
What does a zero clue tell me?
That entire row or column contains no tents. Mark its available cells as grass.
Where is a useful first move?
Find a tree with only one possible adjacent tent cell after applying borders, zero clues and existing placements.
What happens when a line has enough tents?
Its remaining cells must be grass. That may narrow the options around a nearby tree.
Does a green clue prove the whole puzzle is right?
A satisfied line count is only one condition. Check tree pairing and non-touching rules too.
How do I mark grass?
Use the alternate action on a cell. On touch screens, use the Primary/Alternate control beneath the board.
Are the daily fields shared?
Yes. The same UTC date and difficulty load the same pinned puzzle seed for everyone.
How do I make a campsite harder?
Increase from 6×6 to 8×8 or 10×10. More trees create more interacting placement decisions.
Nineleaf edition by Good Game Daily. Puzzle engine by Simon Tatham and contributors, used under the MIT license. Original project ↗