Minesweeper ยท History guide
The history of Minesweeper
A 1980s minefield game, a Microsoft bundle that taught a generation to use a mouse, and a proof that the puzzle is as hard as any problem in NP.
The short answer
- Minesweeper's predecessors include Mined-Out (1983) and Relentless Logic (1985).
- The Microsoft version was written by Robert Donner and Curt Johnson and shipped in 1990.
- Bundling it with Windows taught millions of users precise mouse control, including right-click.
- Richard Kaye proved the Minesweeper consistency problem NP-complete in 2000.
- Competitive play measures boards by 3BV and rewards chording efficiency.
Before Windows
Minesweeper's ancestors are 1970s and 1980s computer games about crossing a grid full of hidden hazards. The mechanic โ move, get told something about your surroundings, deduce the rest โ is older than the personal computer.
Two games are usually named as direct predecessors. Mined-Out (Ian Andrew, 1983) for the ZX Spectrum required you to walk across a minefield being told how many mines were adjacent. Relentless Logic (1985) for MS-DOS is even closer to the modern game: a grid, hidden mines, numbers that count neighbours, and a deduction problem rather than an arcade one.
1990: the version everyone played
The Minesweeper the world knows was written for Microsoft by Robert Donner and Curt Johnson, and shipped in the Microsoft Entertainment Pack in 1990. From Windows 3.1 in 1992 it was included with the operating system itself, and it stayed there for two decades.
Bundling it was a deliberate piece of user training. Solitaire taught people to drag and drop; Minesweeper taught them precise mouse control, including the right mouse button and the left-and-right chord click. Millions of office workers learned to use a mouse properly while believing they were wasting time.
Minesweeper is NP-complete
In 2000 the mathematician Richard Kaye proved something that gives the game an unusual academic standing: the Minesweeper consistency problem โ given a partially revealed board, is there any arrangement of mines consistent with it? โ is NP-complete.
The proof works by building logic circuits out of minesweeper patterns: particular arrangements of numbers and closed squares behave exactly like AND gates, OR gates and wires. If you could solve arbitrary Minesweeper positions efficiently, you could solve every problem in NP efficiently โ which is the million-dollar P versus NP question.
The practical translation for a player: there is no shortcut. On a hard board, the reason a position feels like it needs you to consider many combinations at once is that, in the general case, it genuinely does.
Speedrunning and the modern scene
Competitive Minesweeper is a real discipline with verified world-record boards, timing to milliseconds and an active community of ranked players. Expert boards are cleared in well under ten seconds by the best players, which requires both perfect pattern recognition and a specific mouse technique.
Two concepts from that community are useful even for casual players:
- 3BV โ the minimum number of clicks needed to clear a given board with perfect play. It measures how hard a board is, independent of the player.
- Efficiency โ your actual clicks compared with the board's 3BV. High-efficiency play uses chording heavily and flags only when flagging enables a chord.
The game itself has also been rehabilitated: after being removed from the default Windows install, it returned as a downloadable app, and open implementations โ including no-guessing generators, which the original never had โ are now the version most people play.
Common questions
Who created Minesweeper?
The Microsoft version was written by Robert Donner and Curt Johnson in 1990. The game builds on earlier minefield games such as Mined-Out (1983) and Relentless Logic (1985).
Why was Minesweeper included with Windows?
To teach mouse skills. Solitaire taught dragging; Minesweeper taught precise clicking, right-click and the two-button chord โ while feeling like a game rather than a tutorial.
Is Minesweeper NP-complete?
Yes. Richard Kaye proved in 2000 that deciding whether a partially revealed board is consistent is NP-complete, by constructing logic gates out of minesweeper patterns.
What is 3BV in Minesweeper?
The minimum number of clicks needed to clear a board with perfect play. Competitive players compare their click count against it to measure efficiency.
Is Minesweeper still on Windows?
Not by default since Windows 8, but it is available as a download, and open versions โ many with no-guessing board generation โ are now the most played.
Play Minesweeper free, right now
No sign-up, no download โ it runs in your browser against the computer, a friend on the same device, or a friend online.