Minesweeper; T,T,'nT trial

[Juliette]

Code: Select all

  ABCDEFGHIJ
1 ==========
2 ==========
3 ==========
4 ==========
5 ==========
6 ==========
7 ==========
8 ==========
9 ==========
10==========

* bomb
= unexplored

This 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.

[Juliette]

4

=> 4 bombs surrounding 5E.

Code: Select all

  ABCDEFGHIJ
1 ==========
2 ==========
3 ==========
4 ==========
5 ====4=====
6 ==========
7 ==========
8 ==========
9 ==========
10==========

[Apadamek]

4,E

[ƒëmmë ƒatalë]

9 B

[Juliette]

9 B

Yea see.. you have to say how many bombs there are on Apadamek!'s chosen location instead of posting a new location.. just say something, logically possible, and attempt to keep the game running as long as possible without finding any bombs (and without saying there are no bombs..).