FIXED PRACTICE BOARD

Tents & Trees study 8

Solve at your own pace. Ask what follows from the position before applying the suggested move.

Study ID: tents-08 · Original board: tents-2027-06-05

Required tent counts; T marks a tree
C11C21C31C41C50C62
R11
R21
R31
R42
R50
R61

Loading interactive controls…

Work from the current board

Activate a non-tree square to cycle unknown → tent → grass.

Tab to any control and use Enter or Space.

Interactive help is separate from the written starting-board solution below.

Review the techniques

Rules and proof limits

Put one tent beside each tree, directly above, below, left or right. Each tent belongs to one different tree. Tents cannot touch, even diagonally. The row and column counts give the required number of tents. Mark grass where a tent cannot go.

An adjacent tree is necessary for a tent but does not prove the square must contain one. A tent beside two trees cannot serve both. Completed counts and non-touching tents still require a valid one-to-one matching. The introductory exercises do not teach every matching deduction needed by harder boards.

Show the checked route from the starting position (9 steps)

This route starts from the original study position. It does not describe moves you made differently. Use “Explain a next step” for a deduction from your current marks.

  1. A row or column clue of zero allows no tents. Mark R2C5, R3C5, R4C5, R5C1, R5C2, R5C4, R5C5, R6C5 as grass; tree squares stay unchanged.
  2. R1C1, R1C2, R2C1, R2C2, R2C3, R2C6, R3C2, R3C3, R3C4, R3C6, R4C4, R6C4 have no tree directly above, below, left or right. A diagonal tree is not sufficient, so these squares are grass.
  3. Row 2 needs 1 tents and already has 0. Its 1 remaining candidate square must all be tents because every candidate is needed.
  4. The tent at R2C4 excludes all touching squares, including diagonals. Mark R1C3 as grass.
  5. Row 1 needs 1 tents and already has 0. Its 1 remaining candidate square must all be tents because every candidate is needed.
  6. Row 3 needs 1 tents and already has 0. Its 1 remaining candidate square must all be tents because every candidate is needed.
  7. The tent at R3C1 excludes all touching squares, including diagonals. Mark R4C2 as grass.
  8. Row 4 needs 2 tents and already has 0. Its 2 remaining candidate squares must all be tents because every candidate is needed.
  9. Column 2 needs 1 tents and already has 0. Its 1 remaining candidate square must all be tents because every candidate is needed.
Required tent counts; T marks a tree
C11C21C31C41C50C62
R11
R21
R31
R42
R50
R61

Final check

Row and column counts match, tents do not touch, and a complete one-to-one assignment exists between trees and adjacent tents.

Back to the centreTry the regular game

Playfield Arcade · Updated 3 October 2026 · AI-assisted writing and code; examples checked against explicit constraints. Our method · Report a correction