minesweeper test

Game steps:

* When the game starts, the player gets prompted for the grid size (width x height) and the number of mines.
* The grid is generated according to these requirements.
* The games starts, the user is prompted for the coordinates (x, y) of the first cell to uncover.
* The game shows the resulting grid and prompts for new coordinates.
* And so on ...
The game ends when there is no more non-mined cell to uncover or the player uncovers a mine.

Rules:

* Uncover a mine, and the game ends.
* Uncover an empty cell, and the player keeps playing.
* In each empty uncovered cell the number of adjacent cells holding mines is displayed.
* Uncovering a cell holding the number '0' (=no adjacent mined cells) uncovers all adjacent cells, and so on.

Notes:
Command-line is sufficient, no fancy ui needed.
Basically it's the good old windows minesweeper (minus flags).

I need a clarification regarding the rules.
The 4th one says "Uncovering a cell holding the number '0' (=no adjacent mined cells) uncovers all adjacent cells, and so on". The requirement is intended to be recursive, right?

To clarify better: if a cell has no mine around it will uncover all adjacent cells and for every cells uncovered with no mine all the adjacent cells will be uncovered in the same step. This process is stopped as soon a cell with at least one mine around is uncovered. Is this right?

I am going to use this one http://minesweeperonline.com to refresh my memory.

Thanks

Here is my implementation:
https://github.com/micheleorsi/minesweeper

I tried to use at best the design patterns along the full project. On the other hand I was a bit in a rush at the end and "MainApplication" is the only part a bit 'quick & dirty' ..