🧩 Minesweeper

Minesweeper was included with Windows 3.1 in 1990 and became one of the most played computer games in history. Its deceptively simple premise — reveal all non-mine squares using number clues — conceals genuine mathematical depth that has fascinated both casual players and computer scientists for decades.

The number system is the game's entire logic engine: each revealed number tells you exactly how many of the eight surrounding squares contain mines. From this single data point, combined with information from all adjacent revealed squares, you can often deduce with mathematical certainty whether specific unrevealed squares are safe or dangerous.

Minesweeper gained academic attention when it was proven to be NP-complete — meaning that determining whether a given Minesweeper board configuration is solvable without guessing is computationally equivalent to some of the hardest problems in mathematics. This theoretical complexity underlies the practical reality that some board configurations require unavoidable probability guesses.

Competitive Minesweeper is played on the Expert grid (30×16, 99 mines) with world record times around 30 seconds. Achieving these times requires not just perfect logical deduction but mastery of "chording" (middle-clicking satisfied numbers to reveal all adjacent cells simultaneously) and practiced pattern recognition that makes common configurations instantly solvable.

For casual players, Minesweeper offers a satisfying pure logic exercise. Start with Beginner (9×9, 10 mines) and progress through Intermediate to Expert as your pattern recognition improves. The same logical principles apply at every level — only the scale changes.

The competitive Minesweeper community maintains internationally tracked world records for Expert grid completion times. World record times are around 30 seconds for the 30x16 grid with 99 mines — a speed requiring pattern recognition so automatic that individual mine positions are assessed and flagged in under a second. Reaching sub-60-second Expert times is a meaningful achievement for dedicated players.

The NP-complete complexity of Minesweeper — proven by Richard Kaye in 2000 — establishes it as a genuinely hard mathematical problem. Determining whether a given partially-revealed Minesweeper board is solvable without guessing is computationally equivalent to some of the most difficult problems in theoretical computer science. This theoretical depth underlies the practical experience that some board configurations resist solution regardless of skill level.