Candidate Elimination in Sudoku: A Systematic Approach
Candidate elimination is the fundamental logic engine of Sudoku, where you systematically remove impossible numbers from cells until only one valid candidate remains. This process of reduction, which transforms a grid of possibilities into a grid of certainties, is the central action in every solving step, from the simplest to the most complex. By understanding and applying a structured approach to elimination, you can methodically reduce the puzzle's complexity and find the solution. This article outlines the systematic sources, methods, and hierarchy of candidate elimination.
The Three Sources of Elimination
In Sudoku, every cell must contain a unique digit from 1 to 9. To determine the correct digit, you eliminate numbers that cannot possibly go there based on Sudoku's three core constraints: the row, the column, and the 3x3 box. These three intersecting zones are the 'peers' of a cell; any digit already placed in any of these peers becomes an impossible candidate for the unsolved cell.
This creates a powerful cross-hatching effect. For example, if the number 5 is already in a cell's row, you can eliminate 5 from all other unsolved cells in that row. The same logic applies if 5 is in the column or the box. The combined pressure from all three zones is what ultimately whittles down possibilities to a single solution.
Direct Elimination: The First and Simplest Step
The most immediate form of elimination happens when you place a solved digit. Once a digit is confirmed in a cell, you can and must remove it as a candidate from all other cells in that cell's row, column, and 3x3 box. This is a non-negotiable, rule-based action.
This direct elimination often creates a cascade, revealing new solved cells. For instance, removing a candidate from eight cells in a unit might leave one cell with only one remaining possibility, creating a Naked Single. This is the most basic solving technique and the direct result of accurate candidate elimination. Our hint engine finds that consistent application of this simple rule solves a significant portion of beginner and intermediate puzzles.
Technique-Based Elimination: Applying Advanced Logic
Beyond direct removal, elimination is driven by logical patterns among the candidates themselves. These techniques identify relationships between unsolved cells to prove that certain candidates are impossible in specific locations. The goal is to create a new Naked Single or simplify another pattern.
Common patterns include subsets like Naked Pairs, where two cells in a unit share the same two candidates, allowing you to eliminate those two digits from all other cells in that unit. Intersection removal, such as a Pointing Pairs, uses a candidate confined to one row or column within a box to eliminate it from the rest of that row or column outside the box. More complex strategies like the X-Wing use candidate alignment across multiple rows and columns to perform powerful, far-reaching eliminations. Each technique provides a logical proof for why a candidate cannot exist in a particular cell.
- Focus on one candidate (digit) at a time when scanning for patterns like X-Wings.
- Technique-based eliminations don't directly place a number; they clear the way for a simpler placement later.
Maintaining Candidate Accuracy
A systematic approach is only as good as the data it uses. Inaccuracies in your pencil marks (the small candidate numbers you write in the corners of cells) will lead to incorrect eliminations and a dead end. Therefore, maintaining pristine candidate notes is critical.
Develop a disciplined routine: after every digit placement, immediately eliminate that digit from all peer cells. Periodically scan the puzzle to check for candidates that have become impossible due to recent placements you may have missed. Many solvers get stuck not for lack of advanced strategy, but because their candidate grid is outdated. Accurate pencil marking is the foundation upon which all advanced elimination logic is built.
The Elimination Hierarchy: What to Try First
To solve efficiently, approach elimination in a logical order of increasing complexity. Start with the simplest, most rule-based actions before progressing to pattern recognition. This hierarchy saves time and mental energy.
First, always perform direct elimination from any solved cell. Next, scan the grid for cells reduced to a single candidate (Naked Singles). If none are found, look for the simplest patterns, like Naked Pairs or Pointing Pairs, within rows, columns, and boxes. Only after exhausting these should you move to more complex, multi-step patterns like the X-Wing. This step-by-step process ensures you don't overlook easy wins while searching for complex logic.
- If you're stuck, re-scan the puzzle from the beginning using this hierarchy; you often miss simple eliminations after focusing on hard ones.
Key Facts
- ▪Candidate elimination is the process of removing numbers that cannot be in a cell based on Sudoku's row, column, and box rules.
- ▪Every elimination stems from one of three sources: a digit in the same row, the same column, or the same 3x3 box.
- ▪Placing a solved digit triggers direct elimination, removing that digit as a candidate from all 20 other cells in its row, column, and box.
- ▪Techniques like Naked Pairs and X-Wing use logic between unsolved cells to eliminate candidates, rather than relying on a placed digit.
- ▪Accurate pencil marking of all possible candidates in each cell is essential for correct technique-based elimination.
- ▪A systematic solving hierarchy starts with direct elimination, then seeks Naked Singles, before moving to basic and then advanced patterns.
- ▪Elimination techniques simplify the puzzle by creating new Naked Singles or exposing other patterns.
- ▪Most solving errors occur due to incomplete or incorrect candidate notes, not a failure of advanced logic.
Frequently Asked Questions
What is the difference between direct elimination and technique-based elimination?
Direct elimination removes a candidate because the digit is already placed in a peer cell. Technique-based elimination uses logic (e.g., Naked Pairs) among unsolved candidates to prove a number cannot go somewhere, even though it isn't placed yet.
How do I know my candidate pencil marks are accurate?
After every move, update all peer cells. Periodically re-scan the grid, checking each cell's candidates against all solved digits in its row, column, and box. Inconsistencies mean your notes are wrong.
Which elimination technique should I learn first?
Master direct elimination and spotting Naked Singles first. Then learn Naked Pairs and Pointing Pairs. These solve most intermediate puzzles before you need advanced strategies.
What if eliminating candidates doesn't reveal a solution?
You may need a more advanced technique, or your candidate notes may be inaccurate. Re-check your pencil marks, then look for patterns like locked candidates or X-Wings.