This page was automatically generated by NetLogo 4.0.3. Questions, problems? Contact email@example.com.
The applet requires Java 1.4.1 or higher. It will not run on Windows 95 or Mac OS 8 or 9. Mac users must have OS X 10.2.6 or higher and use a browser that supports Java 1.4. (Safari works, IE does not. Mac OS X comes with Safari. Open Safari and set it as your default web browser under Safari/Preferences/General.) On other operating systems, you may obtain the latest Java plugin from Sun's Java site.
powered by NetLogo
view/download model file: Meatsweeper.nlogo
This is game of strategy. There are land mines hidden beneath the green landscape. Your job is to locate all of the mines without exploding any of them.
If you click on a patch of grass without a mine, a number appears. The number tells you how many adjacent mines there are.
If you click on a mine, the mine explodes, and you lose the game.
You win the game by uncovering every square that doesn't have a mine.
If you lose, the land turns red. If you win, it turns blue.
Press SETUP to set up the board, then press GO to play the game.
While GO is pressed, click on green squares to check them for mines.
To help you remember where where you think the mines are, you can mark a square by pointing at it and pressing the M key. (Note the M in the corner of the MARK/UNMARK button. If the M is grayed out, hide the command center.)
You can make the game easier or harder by adjusting the MINE-COUNT slider before pressing SETUP.
Use the numbers to deduce where it is safe to click and where it isn't.
Can you always know where it is safe to click, or do you have to guess sometimes?
Note that when you click in an empty region, the model saves you time by automatically clearing all the surrounding empty cells for you. This keeps the game from being tedious.
Try to win the game as fast as possible. Your time appears in the CLOCK monitor.
Try playing with a bigger or smaller board by editing the view and adjusting min-p(x/y)cor and max-p(x/y)cor.
Write out a file to disk containing the best times players have achieved so far for a given board size. Update the file when someone beats a previous time.
Write a computer player that can play the game automatically. What strategy should it use?
Modify the game to use a hexagonal grid instead of a square one. (See Hex Cells Example, in Code Examples, to see how to make a hexagonal grid.)
The NEIGHBORS primitive is used to find neighboring squares.
Some of the models in Cellular Automata section, under Computer Science, also have rules based on how many neighboring cells are occupied.
According to http://en.wikipedia.org/wiki/Minesweeper_%28computer_game%29 , Minesweeper was invented by Robert Donner in 1989. A version of the game is included with the Windows operating system.
Landmines are a real problem that kills people every day. To learn more about the campaign to ban landmines, see http://www.icbl.org .
To refer to this model in academic publications, please use: Wilensky, U. (2005). NetLogo Minesweeper model. http://ccl.northwestern.edu/netlogo/models/Minesweeper. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL.