Guides and tips

Minesweeper Subset Logic: Chains, Dependencies and Endgames

Use subset differences and reduced clues to follow forced dependency chains, then separate certainty from an unresolved endgame choice.

File-Tools24 Team · 2026-10-07 · 5 min read

Treat adjacent clues as equations over covered squares

Subset logic starts by comparing the covered neighbours of two revealed numbers. If clue A's remaining candidate set is fully inside clue B's set, subtract A's remaining mine count from B's. The difference tells you how many mines must be in B's additional squares. This can reveal a safe group, a mine group, or a precise count without knowing the identity of every mine first.

For example, if one clue needs one mine in two squares and a neighbouring clue needs two mines in those same two squares plus two additional squares, the additional pair contains exactly one mine. That is useful information, but it does not yet say which of the pair is mined. Preserve that distinction.

Build a dependency chain from both directions

A solved subset can reduce the next clue, which can expose a second subset. Start at a clue with the smallest candidate set, record its remaining mine count, and carry only forced counts forward. Long chains are easier to audit from both ends: a count that must be satisfied at one end can close a candidate group at the other.

Do not convert every partial count into flags. A group known to contain one mine is not the same as a known mine square. Keeping partial groups unflagged avoids false reductions and keeps the board readable.

Endgames: count globally only when the boundary is complete

Near the end, the total remaining mine count can prove that all remaining unconstrained squares are safe or mined. That conclusion needs a complete inventory: all unresolved candidate groups, all confirmed mines, and the displayed remaining mine total. When several combinations remain valid, the position is unresolved rather than logically solved.

File-Tools24 Minesweeper does not calculate probabilities, detect patterns, chord around numbers, or promise no-guess boards. Use the Daily Challenge as a repeatable practice field, not as a claim that every board state has a forced move.

FAQ: Does a subset always identify one exact mine?

No. It may identify a count for a group. An exact mine follows only if the difference group has one square or another clue separates it.

FAQ: When should I compare a chain from both ends?

Use both directions when several reduced clues overlap. A count propagated from one end can make an otherwise ambiguous group at the other end exact.

FAQ: Can remaining-mine counting solve every endgame?

No. It works only if the known groups and global remaining-mine total eliminate all alternatives. Otherwise multiple valid combinations can remain.

If the difference between a confirmed mine and a player flag is still unclear, begin with Numbers, patterns and risk. When a set difference comes specifically from a board edge, verify its geometry with Edge patterns and reductions.

Next step

Open Minesweeper, try the Daily Challenge, and record partial mine counts before turning any uncertain square into a flag.