Minesweeper

From WPC unofficial wiki
Revision as of 20:52, 13 August 2024 by Djmathman (talk | contribs) (→‎Appearances in the past WPCs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Rules[edit]

Place mines into the un-numbered cells in the grid, at most one mine per cell, so that each number in a cell represents the number of mines adjacent to that cell (including diagonally adjacent cells).

(Rules and example from PGP IB)

Rule variations[edit]

  • Sometimes the total number of mines are given.
  • Shape Minesweeper: Instead of single-cell mines, this variant requires solvers to place a given set of shapes in the grid. Probably the oldest of this type of variation is "Battleships varia #2" from WPC 1999/Part 9. The objective was to place a standard fleet of battleships so that numbers in a cell represent a number of ship segments adjacent to it. Most puzzles require shapes not to touch each other, but a puzzle from WPC 2017/Round 4 allowed it.

History of the puzzle[edit]

The first Minesweeper game on PC appeared in 1983.[1] See the Wikipedia article on the game for more details.

Variants[edit]

Shape Minesweeper and Triangular Minesweeper are both variants of Minesweeper, but since they are both recurring to WPC and very distinct from normal Minesweepers, they have separate articles.

Sudoku[edit]

Originally appeared on Grandmaster Puzzles. Author of the puzzle was Serkan Yürekli (Turkey). In WPC 2023 the name was shortened to "Minedoku".

Place mines into the un-numbered cells in the grid, at most one mine per cell, so that each number in a cell represents the number of mines adjacent to that cell (including diagonally adjacent cells). Also, each row, column, and bold region must contain exactly the indicated number of mines.

(Rules and Example from Grandmaster Puzzles)

Appearances in the past WPCs[edit]

References[edit]