# Triangular Minesweeper

## Rules[edit]

Place the given number of right-angled triangles into some empty cells in the grid. Each triangle occupies exactly half of a cell. Triangles cannot touch each other, not even at a point. Clues in cells show the number of triangles touching that cell, including only at a point.

(Rules and example from WPC 2015 IB)

### Rule variations[edit]

- The "given number" is usually 15. This is similar to the length of Snake usually being 45 cells long.

## History of the puzzle[edit]

Appeared on the 4th round of 2007 IPST (Internet Puzzle Solving Test). The puzzle was written by Andrey Bogdanov (Russia).

Obviously this puzzle is related to Minesweeper, but the logic involving vertices of triangles makes the genre quite different from the original.

## Appearances in the past WPCs[edit]

- WPC 2015/Round 2 by Andrey Bogdanov
- WPC 2014/Round 1