This section is grossly outdated and is now maintained
only for archival purposes.
This is the age old game of minesweeper, without the cool graphics. It was written for a CS class in which I was enrolled. Yippie! Isn't Java cool? No, actually. But hey, take a look at the COOLER games I have written in C and C++ if you want hardcore play.
Twenty cans of Spam have been hidden in the grid above. The objective is to safely "diffuse" these cans of Spam, without accidently "detonating" one of them. Using the mouse, you may click on any grid cell.
- If you click on a can of Spam, the game is over (and you need to clean up the icky mess!).
- If you click on an empty grid cell, a number between 0 and 8 will be displayed, indicating how many of the cell's 8 neighbors contain cans of Spam.
- If the number is 0, all 8 neighbors are safe to examine and this will be done for you automatically. (Since some of those cells may be 0 themselves, this process may result in many new numbers being displayed!)
- When you have determined that a cell contains a can of Spam, you can diffuse it by holding the SHIFT key down and then clicking on the cell. Be careful not to diffuse an empty cell!
The above instructions were taken from the homepage of the professor who gave me the assignment: Prof. Ran Libeskind-Hadas