Advanced family · 04
Uniqueness
Candidate patterns that use a valid puzzle's single-solution assumption to eliminate candidates.
The uniqueness family
PREVENT A SECOND SOLUTION BY RECOGNIZING DEADLY CONFIGURATION.
Uniqueness techniques use an additional assumption common to valid classic Sudoku puzzles: the puzzle is intended to have one unique solution. When a candidate pattern could create two valid completions, that pattern cannot be allowed to remain. They require a specific candidate configuration and a clear uniqueness proof.
There are two set of uniqueness family: Unique Rectangles, and BUGs:
A Unique Rectangle is a "deadly" pattern of four cells occupying exactly two rows, two columns and two boxes, each cell contains the same two candidates.
A BUG stands for a Bivalue Universal Grave, it is an invalid state where every unsolved cell has only two candidates and every candidates. appears exactly twice in every row, column and box.
Each family has various techniques to break those invalid deadly patterns to ensure a valid Sudoku puzzle have one unique solution.
The question: Would leaving these candidates unresolved create a second solution?
Explore the family
UNIQUENESS TECHNIQUES
01 · Uniqueness
Unique Rectangle Type 1
Extra candidates in one corner cell prevents a deadly rectangle.
Unique Rectangle Type 1 →02 · Uniqueness
Unique Rectangle Type 2
A shared extra candidate by two corners forces an elimination from outside cells seeing both corners.
Unique Rectangle Type 2 →03 · Uniqueness
Unique Rectangle Type 3
Extra candidates combine with a subset to prevent the deadly rectangle.
Unique Rectangle Type 3 →04 · Uniqueness
Unique Rectangle Type 4
A locked rectangle number in a house forces removal of the other number from the house.
Unique Rectangle Type 4 →05 · Uniqueness
Hidden Rectangle
The same uniqueness structure is hidden under additional candidates.
Hidden Rectangle →06 · Uniqueness
Avoidable Rectangle
A rectangle formed around placed cells can still expose a uniqueness constraint.
Avoidable Rectangle →07 · Uniqueness
BUG+1
One extra candidate breaks an otherwise complete Binary Universal Grave.
BUG+1 →08 · Uniqueness
BUG+2
Two exceptional cells break the BUG pattern and create a shared uniqueness constraint.
BUG+2 →09 · Uniqueness
BUG+3
Three exceptional cells extend the BUG reasoning into a broader candidate relationship.
BUG+3 →OTHER UNIQUENESS TECHNIQUES
Looking for more BUGs?
We will add more in the future.