Hidden Pair in Sudoku: How to Find Hidden Pairs

A Hidden Pair occurs when two digits can appear only in the same two cells of a row, column, or box.

Those cells may contain many other candidates.

The pair is “hidden” because you discover it by tracking the digits, not by noticing two tidy bivalue cells.

Once the pair is proven, remove every other candidate from the two pair cells.

Quick rule

Two digits.

Only two possible cells for those digits inside one unit.

→ Keep the two pair digits and remove the other candidates from those cells.

A simple example

Suppose row 3 contains:

r3c2 {1,4,6,9}
r3c7 {2,4,8,9}

Now inspect where digits 4 and 9 can appear in the entire row.

If:

4 appears only in r3c2 and r3c7;
9 appears only in r3c2 and r3c7;

then those two cells must contain 4 and 9 in some order.

The other candidates are impossible:

remove 1 and 6 from r3c2;
remove 2 and 8 from r3c7.

The hidden structure becomes a visible {4,9} pair.

Why the elimination is valid

Row 3 still needs both 4 and 9.

Neither digit has any possible position outside the two target cells.

Therefore the two cells are reserved for those two digits.

If one of the cells took some other value — for example 6 — then 4 and 9 would be left competing for only one remaining cell.

That cannot complete the row.

So every non-pair candidate inside those cells is false.

Step-by-step board example

Hidden Pairs work in rows, columns, and boxes

The source unit can be any:

row;
column;
box.

The proof does not depend on the shape of the unit.

It depends only on this positional fact:

both target digits have no valid positions outside the same two cells.

Hidden Pair vs Naked Pair

These are dual descriptions of the same two-for-two reservation.

Naked Pair

Cell-first

These two cells contain only X and Y.

Then X/Y can be removed elsewhere in the unit.

Hidden Pair

Digit-first

X and Y can appear only in these two cells.

Then every other candidate can be removed from the two cells.

After the cleanup, a Hidden Pair becomes a visible Naked Pair within that unit.

Hidden Pair vs Hidden Single

This is a natural counting progression.

Hidden Single

1 digit → 1 cell.

Hidden Pair

2 digits → 2 cells.

Hidden Triple

3 digits → 3 cells.

That progression is useful because it shows that Hidden Subsets are not unrelated pattern names. They are the same positional-reservation idea at different sizes.

How to find Hidden Pairs

Do not search by candidate count.

Search by candidate occurrence inside a unit.

1. Choose one unit

A row/column/box with several missing digits is a good target.

2. Count positions by digit

Which missing digits have only two possible positions?

3. Compare the position pairs

Do two digits share exactly the same two cells?

4. Clean the cells

If yes, remove all other candidates from those two cells.

Candidate highlighting is particularly useful here because the useful information is distributed across the unit rather than concentrated inside one cell.

A pair can be very deeply hidden

Consider:

A {1,2,4,6,8}
B {2,3,4,7,8}

If digits 4 and 8 occur nowhere else in the unit, then A/B contain a Hidden Pair {4,8} despite carrying many notes.

This is why Hidden Pairs can be harder to see than Naked Pairs even though the underlying logic is equally simple.

What does the cleanup unlock?

Removing the extra candidates can:

create a Naked Pair;
create a Naked Single elsewhere through later eliminations;
simplify another unit the pair cells belong to;
expose a subset or Locked Candidate.

Do not stop after erasing the notes. Re-scan the affected cells and their peers.

Common mistakes

Finding two digits that each occur twice, but in different cells

The two target digits must be confined to the same two cells.

Removing the pair digits

Keep X and Y.

Remove the distracting candidates.

Expecting X and Y to appear in both pair cells

They often do, but the general hidden-subset logic is about the digits being confined to the two-cell set. What matters is that neither digit can appear outside those cells in the source unit.

Using incomplete notes

A missing legitimate candidate can create a fake Hidden Pair.

Looking only for tidy bivalue cells

If the cells already show only {X,Y}, you are looking at the cleaned result rather than the hidden discovery process.

Recognition drill

Inside one unit, ask:

Which digits are running out of places?

If two digits each have only two positions, compare the positions.

That question scales naturally into Hidden Triples later.

FAQ

Does a Hidden Pair become a Naked Pair?

After its extra candidates are removed, yes: the two cells contain only the reserved pair digits.

Must the pair cells be adjacent?

No.

Can one of the target digits appear in only one of the two cells?

If that happens, the digit is already a Hidden Single and should normally be solved first. In a practical Hidden Pair, both digits remain unresolved across the two-cell set.

Why are Hidden Pairs difficult to notice?

Because the pair relationship lives in the distribution of digits across the unit, while the individual cells can contain many distracting notes.

What to learn next

Move to Naked Triples and Hidden Triples to extend the same reservation principle from two cells/digits to three.

techniques · intermediateNaked PairLearn how Naked Pairs reserve two digits for two cells and eliminate those candidates from other cells in the same row, column or box.techniques · intermediateNaked TripleLearn the Naked Triple rule: three cells whose combined candidates contain exactly three digits, allowing eliminations elsewhere in the unit.techniques · intermediateHidden TripleLearn how three digits restricted to the same three cells form a Hidden Triple and which distracting candidates can be removed.techniques · beginnerHidden SingleLearn what a Hidden Single is, how it differs from a Naked Single, and how to find a digit with only one position in a unit.