CS 1410-20 Homework 12

Due: Friday, December 2nd, 2011 10:45am

Implement Minesweeper.

The details are up to you, but your solution should include the following required elements:

• It should be a graphical game implemented with Racket and the 2htdp/universe library or in Java with swing GUI classes. (Racket is probably easier for this task.)
• All tiles should be covered intially.
• Handle clicks on a tile to reveal either a blank space (no adjacent bombs), a number (between 1 and 8 adjacent bombs), or a bomb.
• The initial board should be configurable and it should describe where the bombs are located. Numbers showing adjacent-bomb counts should be computed from that initial board.

You can choose a fixed size for the board, or you can make the size configurable. For initial boards, you can try to generate them randomly or just use a fixed board (as long as the rest of the implementation doesn’t depend on that specific fixed board).

For extra credit, include an option in the game to indicate which of the currently covered tiles could be safely uncovered using at least single-square analysis (as described on the Wikipedia page) and information about the uncovered tiles.