LYCOS RETRIEVER 
Minesweeper
built 277 days ago
The earliest form of Minesweeper was a gambling game that was briefly popular during the 1950s. The player would buy a punchboard, which was made of paper and cardboard. The top layer was cardboard with a square lattice of holes, each of which corresponded to one of the buttons in the present-day Minesweeper game. The holes were blocked by a layer of paper underneath. The player could choose to punch the paper through any hole, and would then see what was printed on a third layer of cardboard underneath that hole. It revealed color-coded information equivalent to that which Minesweeper reveals from a button-click.
Source:
The Only competitive contest for Minesweeper players is a crazy compitition called the Golden Globes. If you want to join, make some crazy song, or crazy movie to get on the "award show."
Source:
The goal of Minesweeper is to find where all the mines (bombs) are within a specific field of squares. To help you, the game shows a number in a square which tells you how many mines there are adjacent to that square. Your task is to work out where the mines are without detonating any of them. So you're probably asking yourself, how could this possibly be difficult? Play free Minesweeper online and discover the creative challenge that is Minesweeper. Free online Minesweeper at Great Day Games - don't blow it!
Source:
The more "sober" viewpoint is that the NP-completeness of Minesweeper shows that Minesweeper really is a rather good game. The fact that it is NP-complete means that it is very difficult to spot when it is possible to clear a square safely in full knowledge that that square is clear, and when some guessing is required. In fact, even if you are told in advance that guessing is not required, it may still be difficult to decide what squares to clear. In some sense, when you play the game you cannot be expected to do much better than the hundreds of very good mathematicians who have worked on the P=NP? question for many many years.
Source:
In 2000, Kaye published a proof that it is NP-complete to determine whether a position in a Minesweeper game is consistent with some placement of mines. [5] Minesweeper is now mentioned in the Clay Mathematics Institute's unofficial description of the P versus NP problem. [6]
Source:
Minimize all windows except Minesweeper, as you move your mouse cursor over each of the squares in minesweeper you should notice the first pixel on the top left portion of the screen change to black. It helps if your windows wallpaper is white because the pixel will change to black. Keep in mind that this is only a single pixel, which is very small and may be hard or impossible for some users to see.
Source:
MORE ABOUT
Minesweeper