Chording vs. Flagging: A Mathematical Review of Minesweeper 3BV Speedruns
An analytical exploration of Bechtel's Board Value, operational click metrics, and the cognitive optimization strategies that separate record-breaking runs from casual play.
Introduction: Defining the Limit of Human Efficiency
Minesweeper, originally popularized as a pack-in game on early Windows operating systems, has evolved into a highly competitive, lightning-fast speedrunning discipline. In modern Minesweeper speedrunning, finishing a board is not enough; the community ranks players based on their **Time** and **Click Efficiency**.
To standardize boards and neutralize the impact of lucky generation layouts, the community uses a metric called **3BV** (Bechtel's Board Value), named after its creator, Stephan Bechtel. 3BV represents the absolute minimum number of left-clicks required to solve a given board configuration without using flags. To push times under the 30-second mark on Expert boards, runners must decide on the fly whether to use a **Flagging** strategy, a **Non-Flagging (NF)** strategy, or a blended **Chording** approach. This article maps the algebraic foundations of these strategies, proving which execution method minimizes physical actions and maximizes speed.
Deconstructing Bechtel's Board Value (3BV)
To analyze speedrun efficiency, we must first understand how 3BV is mathematically calculated. Every generated Minesweeper board is comprised of three types of cells:
- Mine Cells (M): Squares containing mines.
- Empty Cells (E): Vacant squares that share no borders with any mines. When clicked, these trigger an automatic flood-fill cascade, clearing the cell and its adjacent squares.
- Numeric Perimeter Cells (P): Squares that border at least one mine and display a number indicating the adjacent mine count.
The 3BV value of a board is computed by the following algorithm:
- Identify all isolated **Empty Cell Cascades** (continuous regions of empty cells). Each cascade requires exactly **1 left-click** to open the entire region. Let the number of cascades be $C$.
- Identify all **Numeric Perimeter Cells** that are NOT uncovered by any of the $C$ cascades. Each of these remaining number cells must be clicked individually. Let the number of these independent number cells be $I$.
- The Board Value is the sum:
3BV = C + I
Because 3BV represents the baseline left-click count, any extra left-clicks or wasted movements are marked as inefficiencies. A speedrunner's primary goal is to complete the board with an actual click count ($Clicks_{actual}$) as close to 3BV as possible.
Chording vs. Flagging: The Operational Mechanics
There are two primary paradigms of speedrun execution:
1. The Flagging & Chording Method
In this method, the player actively marks identified mines with a flag (Right-Click, $RC$). Once the correct number of adjacent flags are placed around a numeric perimeter cell, the player performs a **Chord** (by clicking both left and right buttons together, middle-clicking, or double-clicking). The chord instantly uncovers all remaining, unflagged adjacent squares.
2. The Non-Flagging (NF) Method
In this method, the player **completely ignores flags**. They do not use a single right-click. Instead, they scan the numbers visually, deduce the mine locations in their working memory, and left-click only the safe squares.
To evaluate these two models mathematically, let us look at the click cost of a simple "1-mine corner" scenario, where a numeric '1' cell borders a single covered mine and five safe, covered cells.
| Execution Strategy | Action Breakdown | Total Clicks | Click-Efficiency Metric ($E = 3BV / Clicks$) |
|---|---|---|---|
| Non-Flagging (Pure Left-Clicks) | 5 independent Left-Clicks on safe cells. | 5 clicks | 100% (Exactly matches 3BV) |
| Flagging & Chording | 1 Right-Click on mine + 1 Left-and-Right Chord click on '1' cell. | 2 clicks | 250% (Saves 3 clicks!) |
This table demonstrates that when local clusters contain high ratios of safe cells to mines, **chording can mathematically shatter the 3BV limit**, resulting in an efficiency score greater than 100%. In this specific scenario, chording saved three clicks. However, this saving is highly deceptive when applied across a full board.
The Flag Overhead Paradox
The mathematical downside of the flagging method is the **Flag Overhead Paradox**. For every chord executed, the player must first place a flag. Placed flags that do not directly facilitate a chord represent wasted operations. Let us represent this through an algebraic cost equation:
Clickstotal = L + F + Ch
Where:
- $L$ is the number of standard Left-clicks.
- $F$ is the number of Flags placed (Right-clicks).
- $C_h$ is the number of Chords executed.
If a player places a flag ($F = 1$) but only uses it to clear a single adjacent cell via a chord ($C_h = 1$), they have spent 2 clicks to clear a cell that could have been cleared with a single Left-click ($L = 1$) in Non-Flagging. In this case, flagging actually **decreased** operational efficiency by 100%.
Statistical analyses of hundreds of thousands of expert-level runs reveal the following threshold: **Chording is only efficient if a placed flag facilitates the clearing of two or more safe cells simultaneously.** If the local cell density yields a ratio of less than 2 safe cells cleared per flag placed, the flagging overhead results in a slower, click-heavy run.
Speed is not just about click counts; it is also about motor travel time. Under Fitts's Law, the time required to move a cursor to a target is a function of the target's distance and width. Flagging forces the cursor to travel to tiny mine cells, increasing index of difficulty ($ID$). Non-Flagging, on the other hand, allows the player's cursor to glide smoothly across safe clusters, minimizing deceleration cycles and boosting overall speed.
The Hybrid Consensus in Modern Speedrunning
Because pure Non-Flagging is cognitively exhausting — requiring the player to maintain an active map of dozens of unflagged mine coordinates in their short-term memory — modern elite speedrunners deploy a **Hybrid Strategy**:
- Open Cascades (NF): In large, open areas with massive cascades, players play in Non-Flagging mode, sweeping through safe perimeter numbers with rapid left-clicks.
- Choked Corners (Flagging): In tight corners with high numeric density (e.g., a cluster of 3s and 4s), players drop rapid flags and execute chords to clear large blockades with a single click.
By blending these two methodologies, runners balance their mental fatigue while keeping their click efficiency close to the mathematical optimum.
Conclusion: Sweep the Board on YuvaMedia
Whether you choose to chord, flag, or run completely flagless, Minesweeper remains an outstanding test of deductive logic, spatial pattern recognition, and motor speed. Understanding Bechtel's Board Value and the mathematical tradeoffs of flagging elevates the game from a random guessing match into a rigorous, calculated science.
At YuvaMedia, our browser-based Minesweeper is designed specifically with performance in mind. Featuring instant chording configuration, responsive flag toggles, complete custom grid generations (including Beginner, Intermediate, and Expert presets), and a zero-latency click engine, it is the perfect sandbox to practice your non-flagging runs or master your chording efficiency. Clear the grid, minimize your clicks, and claim the high score.