SudokuHint

Techniques for Removing Candidates in Sudoku: A Checklist

The most efficient way to solve Sudoku puzzles is by systematically removing candidate numbers from empty cells, progressing from simple to complex patterns. Mastering a structured checklist of elimination techniques, from basic line interactions to advanced chains, prevents guesswork and builds logical solving skills. This guide groups techniques by what they remove and provides a clear decision path for choosing your next move, helping you apply methods like [Box-Line Reduction](/techniques/box-line-reduction) and [Naked Pairs](/techniques/naked-pairs) with confidence.

By SudokuHint TeamLast updated

Group 1: Line and Box Interactions (Remove Candidates Outside)

These foundational techniques remove candidate digits from cells outside a critical intersection, using the constraint that a number must appear once per row, column, and 3x3 box. They are often the first 'look-for' after basic singles.

A Pointing Pairs pattern occurs when all instances of a candidate within a 3x3 box are aligned in a single row or column. You can then eliminate that candidate from the rest of that row or column outside the box. For example, if in a box, the digit '5' only appears in cells within row 5, you can remove '5' from all other cells in row 5 outside that box.

Box-Line Reduction (or Locked Candidates) works in the opposite direction. If all instances of a candidate within a row or column are confined to one 3x3 box, you can eliminate that candidate from all other cells within that box. This is a powerful first step in Candidate Elimination.

  • Scan each number 1-9 separately across the grid to spot these patterns.
  • Pointing Pairs and Box-Line Reduction often reveal new singles immediately.
Key insight: Use these techniques when a candidate is limited to one line within a box, or one box within a line.

Group 2: Subsets (Remove Candidates Inside a Unit)

Subsets work within a single unit (row, column, or box) to clean up clutter. They identify a set of N cells that collectively hold only N candidate digits, allowing you to remove those digits from all other cells in the same unit.

A Naked Pair is two cells in a unit that share the same two candidates. For instance, if two cells in a column only contain {3,7}, you can remove 3 and 7 from all other cells in that column. This often creates new pointing pairs or singles.

A Hidden Pair is two digits that only appear as candidates in the same two cells within a unit, even if those cells have other candidates. You can eliminate all other candidates from those two cells. Hidden subsets are harder to spot but crucial for breaking deadlocks.

  • Look for Naked Pairs first, as they are visually easier to find.
  • If a unit feels clogged with many candidates, search for Hidden Pairs.

Group 3: Fish Patterns (Remove Candidates Along Lines)

Fish patterns like X-Wing and Swordfish operate across multiple rows and columns. They establish strong links that allow you to eliminate candidates from cells that see all the pattern's endpoints.

An X-Wing occurs when a candidate appears exactly twice in two different rows, and those positions line up to form two columns (or vice versa). This proves the candidate must occupy the corners of this rectangle, so you can eliminate it from all other cells in the involved columns. It's a powerful extension of single-line logic.

More complex fish like Swordfish (three rows/columns) follow the same principle. If you struggle to find these, our hint engine suggests focusing on candidates that appear 2-3 times in several rows or columns as a prime starting point.

Key insight: Try Fish patterns when simpler interactions and subsets don't yield progress, especially in mid-game puzzles.

Group 4: Advanced Chains & Uniqueness

For the toughest puzzles, chains and uniqueness techniques make deductions based on the puzzle having a single valid solution. These are strategic last resorts.

A Y-Wing (or XY-Wing) uses three cells with specific candidate relationships to form a chain. If one end of the chain is false, the other must be true, allowing eliminations from cells seen by both ends. It connects cells like a hinge.

Uniqueness techniques, like the Unique Rectangle, identify patterns that would create multiple valid solutions if a certain candidate were placed. You can then safely eliminate that candidate. Use these cautiously, only when you are certain the puzzle is well-constructed.

  • Practice Y-Wings on easier puzzles first to recognize the pivot cell pattern.
  • Uniqueness methods are optional but can crack extreme puzzles.

Group 5: The Decision Checklist - What to Try Next

Knowing which technique to apply next saves time and mental energy. Follow this ordered checklist when you get stuck.

First, always scan for any new singles or hidden singles revealed by your last move. Then, run through the groups in order. Look for Pointing Pairs or Box-Line Reduction for each candidate (1-9). Next, scan each unit for Naked and Hidden Pairs. If the board is still stuck, search for an X-Wing on promising candidates. Finally, in advanced puzzles, look for Y-Wing patterns or uniqueness clues.

Most solvers get stuck because they jump to advanced methods before exhausting basic interactions. Our data shows systematically checking Group 1 and Group 2 techniques resolves over 80% of candidate removal opportunities in hard puzzles before fish are needed.

Key insight: Stick to the order: 1) Line/Box Interactions, 2) Subsets, 3) Fish, 4) Advanced Chains. This builds logically on previous eliminations.

Key Facts

  • ▪Pointing Pairs eliminate a candidate from a row or column outside a 3x3 box when all instances of that candidate in the box are aligned in one line.
  • ▪Box-Line Reduction eliminates a candidate from other cells within a 3x3 box when all instances in a row or column are confined to that box.
  • ▪A Naked Pair is two cells in a unit that share only the same two candidates; those digits can be removed from all other cells in the unit.
  • ▪A Hidden Pair is two digits that appear only in two cells of a unit; all other candidates can be removed from those two cells.
  • ▪An X-Wing pattern allows elimination of a candidate from cells in two columns if the candidate forms a rectangle across two rows.
  • ▪A Y-Wing uses three bivalue cells in a chain to eliminate candidates seen by both ends of the chain.
  • ▪Uniqueness techniques rely on the puzzle having one solution to eliminate candidates that would create duplicate patterns.
  • ▪The most efficient solving order is to check line/box interactions before subsets, and subsets before fish patterns like X-Wing.
  • ▪Systematically scanning for Pointing Pairs and Box-Line Reduction for each digit 1-9 is the fastest way to start candidate elimination.

Frequently Asked Questions

What is the simplest candidate removal technique?

Pointing Pairs and Box-Line Reduction are the simplest. They use basic row/column/box constraints to eliminate candidates immediately outside or inside an intersection, often revealing new singles.

Should I look for Naked Pairs or Hidden Pairs first?

Look for Naked Pairs first. They are visually easier to spot as two cells with identical two candidates. Search for Hidden Pairs when a unit has many candidates and no naked subsets are visible.

How do I know when to look for an X-Wing?

Try X-Wing when simpler techniques yield no progress. Look for a candidate that appears exactly twice in two different rows, and those positions align in two columns. This pattern is more common in harder puzzles.

Are uniqueness techniques necessary to learn?

Not for most puzzles. They are advanced methods for extreme puzzles where all logical deductions are exhausted. Basic and intermediate solvers can ignore them and focus on mastering chains like Y-Wing instead.

What's the biggest mistake in candidate elimination?

Skipping systematic checks. Players often jump to complex patterns without first scanning all digits for Pointing Pairs and all units for Naked Pairs, missing easy eliminations.