Minesweeper; T,T,'nT trial
Posted: Tue Sep 30, 2008 4:12 pm
Code: Select all
ABCDEFGHIJ
1 ==========
2 ==========
3 ==========
4 ==========
5 ==========
6 ==========
7 ==========
8 ==========
9 ==========
10==========
* bomb
= unexploredThis is dynamic minesweeper.
The first poster chooses a spot, which is not to be a bomb.
The next poster posts how many bombs are beside the square.
The next poster chooses a spot again (which may now be a bomb; only the first minesweeper has immunity).
Ad infinitum.
Bombs must be consistent, i.e., the people revealing the bombs must not make the map impossible.
The objective of the game for both revealers and minesweepers is to keep the game going for as long as possible without revealing a bomb.
A maximum of 30 empty squares may be revealed. When an empty square is chosen by a minesweeper, all adjacent squares must be opened as well, just like in normal minesweeper.
Let's try this, OK? See how long it lasts without breaking down.