-
Notifications
You must be signed in to change notification settings - Fork 82
Minesweeper Rules [WIP]
Minesweeper is a puzzle with cells that are either filled or contain a hidden bomb. Your goal is to mark the locations of all bombs and filled cells based on the rules of minesweeper.
- All cells containing a number are not a bomb.
- The number of a cell indicates the total number of bombs contained in the cells adjacent to it (sharing an edge or a vertex).
If a tile can either be filled or a bomb based on the current state of the board, create a split in the tree where the tile is filled in one path, and a bomb in the other to show the different cases.
Create a different path for each valid way to mark bombs and filled cells around a flag.
There cannot be less bombs around a flag than the specified number.
There cannot be more bombs around a flag than the specified number.
Fill the rest of the blank spaces around a flag with bombs if it would satisfy the number specified by the flag.
Fill the rest of the blank spaces around a flag with non-bombs if the number specified by the flag is already satisfied.
If the number of remaining bombs around a flag are covered by another flag, fill the cells not covered by that flag with non-bombs.
If the numbers of two adjacent cells (sharing an edge, not a vertex) have a difference of three, fill the outside of the lower flag with non-bombs and the outside of the higher flag with bombs.
If there are three flags in a line with numbers 1, 2, and 1 respectively, then fill the outside and middle columns with non-bombs.
- Home
-
For Developers
- Programming Standards
- Naming Convention
- Developer Setup Guide
- Alternative Developer Setup Guide (linux)
- Pointers for Getting Started
- Guide to Implementing Puzzles
- Guide to Implementing the Puzzle Editor Functionality for a Puzzle
- Native Binary Compilation Information for Windows
- Test Suite Documentation
- Notes for a Future Rewrite
- For End Users