Tents – Place a Tent Next to Each Tree – Puzzle Game
Tents
In tents, you have a grid of squares, some of which contain trees.
Your aim is to place tents in some of the remaining squares, in such a way that the following conditions are met:
- There are exactly as many tents as trees
- The tents and trees can be matched up in such a way that each tent is directly adjacent (horizontally or vertically, but not diagonally) to its own tree. However, a tent may be adjacent to other trees as well as its own
- No two tents are adjacent horizontally, vertically or diagonally
- The number of tents in each row, and in each column, matches the numbers given round the sides of the grid
Where a tree cannot possibly be, press the right mouse button. This marks the square with the green colour, and is a useful guide.
Game modes:
- 8×8 – Easy
- 8×8 – Tricky
- 10×10 – Easy
- 10×10 – Tricky
- 15×15 – Easy
- 15×15 – Tricky
- Custom mode
Here is a short video demonstrating Guess (Master Mind), Inertia, Tents, Mines (Minesweeper), and Solo (Sudoku).
Below is a short tutorial showing you how to download and compile the latest source code for this game, and the other 38 games in the puzzle collection. The tutorial takes place in Linux, using the Ubuntu 17.10 distribution, but the procedure will be the same, or very similar, for other Linux distributions. If you find the tutorial helpful, please give the video a like and subscribe to our YouTube channel.
| OS | Supported | Notes |
 |  | Besides the main 3 operating system, the puzzle collection has also been ported by contributors to Palm, Android, Symbian 60, iPhone, iPad, and the Windows Store. Homepage: www.chiark.greenend.org.uk/~sgtatham/puzzles/ Developer: Simon Tatham, Richard Boulton, James Harvey, Mike Pinna, Jonas Kölker, Dariusz Olszewski, Michael Schierl, Lambros Lambrou, Bernd Schmidt, Steffen Bauer, Lennard Sprong, and Rogier Goossens License: MIT Written in: C, Java, JavaScript |
 | |
|
 | |