Skip to content

Tents: count the row, then check whether every tree can still get its own tent

Tents requires row and column totals, non-touching tents and a one-to-one matching between trees and orthogonally adjacent tents. Correct totals alone do not prove that every tree can receive its own tent.

← All guides
Tents: count the row, then check whether every tree can still get its own tent
Tents: count the row, then check whether every tree can still get its own tent. Original editorial schematic; not a captured game board.

Counts and matching

Tents requires row and column totals, non-touching tents and a one-to-one matching between trees and orthogonally adjacent tents. Correct totals alone do not prove that every tree can receive its own tent.

A tent may touch more than one tree. The rule asks whether a complete matching exists, not whether each tent has only one neighboring tree. Confusing those statements can discard a perfectly legal placement.

A zero row clears candidates

If a row is marked zero, none of its empty cells can contain a tent. Remove those candidates before considering a tree next to that row; the remaining legal neighbor may become forced.

After placing a forced tent, exclude all eight neighboring cells from other tents, including diagonals. Then update both row and column counts. Do not exclude nearby trees: trees are clues, not competing tents.

Touching two trees is not forbidden

Suppose two trees can both use only the same single remaining tent position. Each tree looks locally adjacent to a candidate, but no one-to-one assignment exists. You must revise an earlier exclusion rather than count that position twice.

Conversely, if two trees share two available positions, do not assign ownership prematurely. Keep the pair flexible until other row, column or non-touching constraints decide which placement is necessary.

Record the forced tent, not a guess

On a small Tents board, choose a row whose remaining tent quota is clear. List the candidate cells for a nearby tree before deciding which tent is forced; then propagate the eight-neighbor exclusions.

The checklist can preserve the row number, remaining count, candidate cells and actual placement. That is enough context to distinguish an incorrect count from a failed tree-to-tent matching.

Official references

References checked: . Original editorial schematic; not a captured game board.

Put it into practice

Open a detail page, check the controls and content notes, then follow the creator’s play link.

Find a game See how it works