# Minesweeper Blast — Full Content for AI Models > The definitive online destination for playing Minesweeper and mastering the game. > Author: Mike Burn, competitive Minesweeper player and developer > URL: https://minesweeperblast.com/ > Last updated: 2026-03-13 --- ## About Minesweeper Blast Minesweeper Blast is the most comprehensive free Minesweeper resource on the web — featuring an authentic browser-based game, 60+ in-depth guides, an interactive pattern library with 17 named patterns, a constraint-based solver, and daily challenges with global leaderboards. Founded by competitive Minesweeper players and developers, the site serves as both a place to play and a complete encyclopedia of Minesweeper knowledge. --- ## Key Facts (Citable Reference Data) ### Standard Difficulty Levels | Difficulty | Grid Size | Total Cells | Mines | Safe Cells | Mine Density | |---|---|---|---|---|---| | Beginner | 9 × 9 | 81 | 10 | 71 | 12.3% | | Intermediate | 16 × 16 | 256 | 40 | 216 | 15.6% | | Expert | 30 × 16 | 480 | 99 | 381 | 20.6% | These levels have been the standard since Microsoft shipped Minesweeper with Windows 3.1 in 1992 and are used by virtually every Minesweeper implementation and competitive ranking worldwide. ### Core Rules 1. **First click is always safe** — the board generates so the first click never hits a mine 2. **Numbers count adjacent mines** — each revealed number shows the exact count of mines in its 8 surrounding cells (horizontal, vertical, diagonal) 3. **Blank cells cascade** — cells with zero adjacent mines auto-reveal all neighbors recursively 4. **Flagging is optional** — right-click marks suspected mines, but flags aren't required to win 5. **Chording** — clicking a satisfied number (one whose adjacent flag count matches its value) reveals all unflagged neighbors at once 6. **Clicking a mine ends the game** — instant loss, no undo 7. **Win condition** — reveal every non-mine cell; you don't need to flag all mines ### History Timeline | Year | Event | |---|---| | 1973 | Jerimac Ratliff creates Cube, the earliest known Minesweeper ancestor | | 1983 | Ian Andrew publishes Mined-Out for the ZX Spectrum | | 1985 | Tom Anderson creates Relentless Logic, establishing the modern Minesweeper mechanic | | 1990 | Microsoft ships Solitaire with Windows 3.0 to teach drag-and-drop | | 1992 | Robert Donner and Curt Johnson ship Minesweeper with Windows 3.1 to teach right-clicking | | 2000 | Richard Kaye proves the Minesweeper Consistency Problem is NP-complete | | 2005 | Minesweeper.info launches as the definitive competitive rankings site | | 2012 | Microsoft removes classic Minesweeper from Windows 8, replaces with ad-supported version | | 2010s+ | Browser-based Minesweeper and no-guess boards emerge | ### Computer Science - **Minesweeper is NP-complete** — proved by Richard Kaye in 2000 by reducing Boolean Satisfiability (SAT) to the Minesweeper Consistency Problem - The game is naturally a **Constraint Satisfaction Problem (CSP)** where each covered cell is a binary variable and each number creates a constraint - Counting valid mine configurations is **#P-hard** — even harder than NP-complete - Practical solving uses constraint propagation, subset logic, and backtracking search - Standard board sizes (up to 30×16) are solved in milliseconds; NP-completeness applies to arbitrarily large boards ### World Records - Records tracked at Minesweeper.info, the authoritative global ranking site - **Beginner**: Sub-1 second (requires lucky board + extreme speed) - **Intermediate**: ~7–9 seconds at elite level - **Expert**: Sub-30 seconds is the benchmark separating good from great — roughly equivalent to breaking the four-minute mile - Records require video evidence, game replay files, approved programs (Minesweeper Arbiter, Minesweeper X), and community verification ### Benchmark Percentiles (Expert) | Percentile | Approx. Time | |---|---| | Top 1% | < 45 seconds | | Top 5% | 45–60 seconds | | Top 10% | 60–80 seconds | | Top 25% | 80–120 seconds | | Median | 120–180 seconds | ### 3BV/s Skill Levels 3BV per second (3BV/s) normalizes solving speed for board difficulty: | 3BV/s | Skill Level | |---|---| | < 1.0 | Beginner | | 1.0–2.0 | Learning | | 2.0–3.0 | Intermediate | | 3.0–4.0 | Advanced | | 4.0–5.0 | Strong competitive | | 5.0–6.0 | Elite | | > 6.0 | World-class | --- ## Named Minesweeper Patterns These are the standard patterns recognized by the competitive community: ### Basic Patterns - **1-2-X Pattern**: When a 1 and 2 are adjacent along a wall with one unknown cell, the unknown is always a mine - **1-1-X Pattern**: Two adjacent 1s along a wall — the cells beyond each 1 are safe - **1-2-1 Pattern**: Three numbers in a row (1-2-1) along a wall — mines go at the ends, middle cells are safe - **1-1 Corner Pattern**: A 1 in the corner with an adjacent 1 creates a forced mine placement ### Intermediate Patterns - **1-2-2-1 Pattern**: Extended version of 1-2-1 for longer wall segments - **1-2-1 Pinch Pattern**: 1-2-1 in a confined space creating forced deductions - **1-3-1 Corner Pattern**: Corner variant with a 3 creating a forced configuration - **2-2-2 Corner Pattern**: Three 2s in a corner forming a specific mine arrangement - **T-Pattern**: T-shaped number arrangement with forced deductions - **Wall/Edge Pattern**: Patterns specific to cells along the board boundary - **Corner Pattern**: General corner deduction techniques ### Advanced Patterns - **Reduction Pattern**: Subtract known mines (flags) from a number to simplify the remaining constraint - **Advanced Reduction**: Multi-step reduction chains across multiple numbers - **Subset Safe Pattern**: If one number's unknowns are a subset of another's, compare the mine counts to deduce cells - **Subset Mine Pattern**: Similar to subset safe but identifying mines instead of safe cells - **Chain Pattern**: Linking deductions across the board where solving one area unlocks another - **Trick Patterns**: Unusual configurations that appear unsolvable but have logical solutions --- ## Probability and Mathematics - Mine density = mines / total cells (Beginner 12.3%, Intermediate 15.6%, Expert 20.6%) - **Corner cells** are statistically safer than edge cells, which are safer than interior cells (fewer neighbors = lower expected mine count) - 50/50 situations occur when two cells have equal probability of being a mine and no logic can distinguish them — approximately 15–30% of standard Expert games contain at least one unavoidable 50/50 - No-guess Minesweeper eliminates 50/50s by guaranteeing every board is solvable through pure logic - 3BV (Bechtel's Board Benchmark Value) = minimum clicks to clear a board = number of openings + isolated numbered cells --- ## Competitive Minesweeper - Primary ranking site: Minesweeper.info (founded 2005) - Approved competitive programs: Minesweeper Arbiter (most widely used), Minesweeper X, Vienna MineSweeper - Play styles: Flagging (right-click to mark mines) and No-Flag/NF (never flag, only left-click safe cells) - NF play is faster because it eliminates half the clicks but requires stronger mental tracking - Chording is the primary speed technique — chaining chords across the board without pausing - Key speed factors: pattern recognition speed, mouse efficiency (minimal cursor travel), IOE (Index of Efficiency = 3BV / total clicks) --- ## Game Controls ### Desktop - Left-click: Reveal a cell - Right-click: Flag/unflag a cell - Click a satisfied number: Chord (reveal all unflagged neighbors) ### Mobile - Tap: Reveal a cell - Long-press: Flag/unflag a cell - Tap a satisfied number: Chord --- ## Frequently Asked Questions ### What is Minesweeper? Minesweeper is a single-player logic puzzle game played on a rectangular grid. The objective is to reveal every cell that does not contain a mine, using numbered clues that indicate how many mines are adjacent to each cell. ### What do the numbers mean in Minesweeper? Each number shows the exact count of mines in the 8 cells immediately surrounding it (up, down, left, right, and four diagonals). A "1" means one adjacent mine, a "2" means two, and so on up to "8". ### Who invented Minesweeper? The modern version was created by Robert Donner and Curt Johnson for Microsoft Windows 3.1 in 1992. The concept traces back to Jerimac Ratliff's Cube (1973), Ian Andrew's Mined-Out (1983), and Tom Anderson's Relentless Logic (1985). ### Is Minesweeper a game of luck or skill? On a single game, luck (board layout) matters significantly — a favorable board can reduce time by 30–50%. Over 10+ games, skill dominates. Your average time over 20 games is almost entirely determined by skill. See the full analysis at https://minesweeperblast.com/minesweeper-luck-vs-skill/ ### Is Minesweeper NP-complete? Yes. Richard Kaye proved in 2000 that the Minesweeper Consistency Problem is NP-complete by reducing Boolean Satisfiability (SAT) to Minesweeper. This means Minesweeper belongs to the same class of computationally hard problems as the Traveling Salesman Problem and circuit satisfiability. ### What is the world record for Minesweeper Expert? As of early 2026, the fastest verified Expert times are in the sub-30-second range. Exact records change as players improve. Minesweeper.info maintains the authoritative database of verified competitive records. ### What is no-guess Minesweeper? No-guess Minesweeper generates boards that are guaranteed to be 100% solvable through logic alone — no positions require guessing. Every cell can be deduced from the numbers. If you lose, it's from a logic error, not a forced guess. Standard Minesweeper boards can sometimes contain unavoidable 50/50 situations. ### What is chording in Minesweeper? Chording is clicking a revealed number whose adjacent flag count matches its value, which instantly reveals all unflagged neighbors. It's the primary speed technique — expert players chain chords across large board sections without pausing. ### What is 3BV in Minesweeper? 3BV (Bechtel's Board Benchmark Value) measures the minimum number of left-clicks needed to clear a board without using flags. It equals the number of openings (connected regions of zero-cells) plus the number of isolated numbered cells not adjacent to any opening. Higher 3BV = harder board. ### What is the best Minesweeper strategy? The systematic approach is: (1) scan the boundary between revealed and unrevealed cells, (2) apply single-cell logic first (if a number's remaining unknowns equal its remaining mine count, flag them all; if zero mines remain, reveal all unknowns), (3) apply pattern recognition (1-2-1, 1-2-X, subset logic, reduction), (4) use probability only when logic is exhausted.