Hard Sudoku Techniques

Hard puzzles provide 25–29 given cells — roughly a third of the grid. Singles (naked and hidden) are scarce at the start, and locked candidates alone are insufficient. Hard Sudoku requires subset elimination: techniques that work on pairs or triples of cells simultaneously, narrowing down candidates without immediately placing a digit.

The core hard techniques are naked pairs, naked triples, hidden pairs, and pointing pairs. These feel unfamiliar at first but become pattern-recognisable quickly. The key mindset shift: you are not always looking for "where does X go?" — sometimes you are looking for "what structure allows me to eliminate X from somewhere?"

A naked pair occurs when exactly two cells in the same group (row, column, or box) both contain exactly the same two candidates — and no other candidates. Because those two cells must hold those two values (one each, in some order), neither value can appear anywhere else in that group.

The elimination logic:

1. Find two cells in the same group, each containing exactly the same pair — for example {3, 7}.
2. Those two values are "reserved" for those two cells. One is 3 and the other is 7 (unknown order).
3. Remove 3 and 7 from the candidate lists of every other cell in the group.

Row 5 candidates (after initial pencil-mark pass):

  Col 1: {3, 7}      ← pair cell A
  Col 2: {1, 5, 9}
  Col 3: {3, 7}      ← pair cell B — same two values, no others
  Col 4: {1, 5}
  Col 5: {1, 5, 9}
  Col 6: {5, 9}
  Col 7: given
  Col 8: given
  Col 9: {1, 9}

Naked pair {3, 7} in cells (5,1) and (5,3).
→ One of those cells is 3 and the other is 7.
→ Remove 3 and 7 from cols 2, 4, 5, 6, 9 (every other cell in row 5).
   Col 2 becomes {1, 5, 9}  (unchanged — no 3 or 7 to remove)
   Col 9 becomes {1, 9}     (unchanged — no 3 or 7 to remove)
   No eliminations happen here, but in other rows the same pair often frees up moves.

The eliminations from a naked pair often expose naked or hidden singles in the same or adjacent groups, triggering a cascade. Always re-scan the affected row, column, and box after applying the technique.

A naked triple extends the naked pair to three cells: if three cells in the same group collectively contain only three distinct candidates between them, those three values are locked in those three cells. Eliminate all three from every other cell in the group.

The cells do not each need to contain all three values — they just cannot contain any value outside the three. Common patterns (using values {A, B, C}):

• {A,B}, {B,C}, {A,C} — each pair of values
• {A,B,C}, {A,B}, {B,C} — one full triple plus two subsets
• {A,B,C}, {A,B,C}, {A,B,C} — all three identical

Naked triples are less common than naked pairs but appear regularly on hard puzzles. Scanning for them systematically — look at boxes first, then rows and columns — is a reliable strategy when other techniques stall.

A hidden pair is the complement of a naked pair. Instead of two cells with only two candidates, look for two digits that appear as candidates in exactly two cells of a group — even if those cells have many other candidates.

If digits A and B each appear as candidates in only cells X and Y within a group, then X must contain one of {A, B} and Y must contain the other. All other candidates in cells X and Y can be safely removed — the pair is "hidden" among those extras.

Box (rows 4–6, cols 4–6) — scanning for digits 2 and 8:

  (4,4): {1, 2, 5, 8}   ← contains both 2 and 8
  (4,5): {1, 5}
  (4,6): {2, 5, 8}      ← contains both 2 and 8
  (5,4): {1, 5}
  (5,5): {1, 5}          ← no 2 or 8
  (5,6): {1, 5}
  (6,4): {1, 5}
  (6,5): {1, 5}
  (6,6): {1, 5}

Digits 2 and 8 appear as candidates in exactly two cells: (4,4) and (4,6).
→ Hidden pair confirmed: (4,4) must be 2 or 8; (4,6) must be 2 or 8.
→ Remove all other candidates from those two cells:
   (4,4) becomes {2, 8}
   (4,6) becomes {2, 8}
→ Now check: (4,5) = {1, 5} — is either a naked single? Not yet.
   But the box now has fewer candidates; re-scan for new singles.

After the elimination, the hidden-pair cells often become naked singles or part of a new naked pair, cascading into further placements. Hidden pairs are frequently the breakthrough move that unlocks a hard puzzle.

Pointing pairs (locked candidates) from medium Sudoku remain important on hard. On hard puzzles they appear less obviously because candidate lists are denser, but the logic is identical:

• For each box, list where each unplaced digit can go.
• If all positions align on one row or column, eliminate that digit from the rest of that row or column outside the box.

On hard difficulty, pointing pairs frequently arise after a naked-pair or hidden-pair elimination has thinned the candidates in a box, exposing a row or column alignment that was not visible before. Running the medium checklist after every subset elimination is essential.

Box-line reduction (a digit in a row or column confined entirely to one box) remains relevant on hard. After naked-pair eliminations thin the candidate lists, rows and columns that previously had a digit spread across two boxes may now show it confined to one — creating a fresh elimination opportunity.

Make it a habit: after every subset-elimination step, re-run both locked candidates and box-line reduction across all rows, columns, and boxes. Hard puzzles are a chain of techniques, each making the next one visible.

Use this decision tree when you are stuck. Work top to bottom, restarting from the top after any successful step:

1. Any naked singles? → Place them, then restart.
2. Any hidden singles? → Place them, then restart.
3. Any locked candidates or box-line reductions? → Eliminate, then restart.
4. Any naked pairs in a single group? → Eliminate, then restart.
5. Any hidden pairs? → Eliminate, then restart.
6. Any naked triples? → Eliminate, then restart.
7. Still stuck? → Verify your pencil marks are accurate and complete. Re-derive candidates for any cell that seems suspicious.

This cycle — place, eliminate, loop — resolves the vast majority of hard Sudoku puzzles. Errors almost always trace back to an inaccurate candidate list, not a missing technique.