How to Eliminate Candidates in Sudoku Without Guessing

If you want to learn how to eliminate candidates in Sudoku, the core idea is simple: stop asking what might fit in one cell and start asking where a digit is restricted inside a row, column, or box. Candidate elimination is the step that turns pencil marks into real progress.

Beginners often treat notes as a passive list. Stronger solvers use them actively. They remove candidates when Sudoku rules prove those options cannot survive. That is how easy scans turn into hidden singles, locked candidates, pairs, and eventually harder patterns.

This guide explains candidate elimination in plain English, with examples you can use on paper or in an app.

Quick Answer: How Do You Eliminate Candidates in Sudoku?

Featured snippet answer: To eliminate candidates in Sudoku, write the possible digits for unsolved cells, then remove any candidate that is blocked by a solved number, restricted by a row, column, or box, or ruled out by a valid pattern such as a hidden single, locked candidate, or pair. After each elimination, rescan the grid because one removed candidate often creates the next forced move.

What Candidate Elimination Means in Sudoku

A candidate is a digit that could still go in an unsolved cell. Candidate elimination means proving that one of those digits cannot stay there.

Example: if a cell has notes 2, 5, 8 and you place an 8 elsewhere in the same column, that cell can no longer contain 8. Its notes become 2, 5. That is a basic elimination.

The same logic scales up. Some eliminations come from direct rule checks. Others come from patterns that restrict where a digit can go.

Why Candidate Elimination Matters More Than Guessing

Guessing chooses a value before the grid has earned it. Candidate elimination does the opposite. It narrows options until one value is forced.

That matters for two reasons:

• it keeps your solve logical and repeatable, and
• it helps you catch easier moves that guessing would hide.

If you are getting stuck in medium or hard puzzles, the problem usually is not that you need to guess. The problem is that you have not reduced the candidate grid cleanly enough yet.

How to Eliminate Candidates in Sudoku Step by Step

1. Start with valid notes

You cannot eliminate candidates from a messy note grid. First make sure each unsolved cell contains only digits that do not already appear in the same row, column, or 3×3 box.

If your notes are outdated, every later step becomes harder to trust.

2. Remove candidates blocked by solved digits

This is the basic elimination most players learn first. Whenever you place a digit, remove that same digit from every unsolved cell in the matching row, column, and box.

Example: if 7 is placed in row 4, no other cell in row 4 can keep 7 as a candidate.

3. Scan one digit at a time

One of the fastest ways to improve candidate elimination in Sudoku is to choose a single digit and follow it through the grid.

When you scan digit by digit, you can see:

• hidden singles,
• digits restricted to one line inside a box, and
• units where a candidate appears only two times.

This is usually more effective than staring at every note in every cell at once.

4. Use box and line interactions

Suppose all the 4 candidates in the top-left box sit only in row 2. That means row 2 must place its 4 somewhere inside that box, so every other 4 in row 2 outside the box can be removed.

This is the logic behind locked candidates, including pointing pairs and box-line reduction. It is one of the most practical elimination tools for intermediate puzzles.

5. Compare repeated candidate sets

If two cells in the same row contain only 3 and 9, those cells must take 3 and 9 in some order. No other cell in that row can keep 3 or 9 as a candidate.

That is a naked pair. The same elimination logic applies to some triples and hidden subsets too.

6. Rescan for singles after every elimination

This is the habit that makes candidate elimination feel powerful. One removed note often creates:

• a naked single,
• a hidden single, or
• a cleaner pair or locked candidate.

If you keep hunting for harder logic without rescanning, you will miss easier progress the puzzle is already giving you.

A Simple Candidate Elimination Example

Imagine row 5 has four unsolved cells with these notes:

• c1 = 2, 6
• c4 = 1, 8
• c7 = 2, 6
• c9 = 1, 3, 8

There are two useful eliminations here:

1. The repeated pair 2,6 in c1 and c7 means no other cell in row 5 can keep 2 or 6.
2. The other two cells now carry the remaining row choices more clearly, which may reveal a hidden single after you rescan the related columns and boxes.

The key point is that candidate elimination does not always place a number immediately. Often it clears noise so the next move becomes obvious.

The Best Order for Candidate Elimination

If you are unsure what to check next, use this order:

1. remove notes blocked by newly placed digits,
2. scan for naked singles and hidden singles,
3. check box-line interactions and locked candidates,
4. compare pairs and triples,
5. only then move to harder fish or chain patterns.

This order keeps the puzzle grounded in the easiest available logic.

Common Candidate Elimination Mistakes

Keeping stale notes

If a solved digit changes the row, column, or box, your notes must change too. Old candidates create false patterns.

Looking for advanced patterns too early

Many stuck solvers jump to X-Wings or chains while the grid still contains missed singles or locked candidates.

Eliminating candidates without proof

If you cannot explain why a digit is impossible, do not erase it. Good eliminations come from structure, not intuition.

Not revisiting the affected units

Every elimination changes nearby rows, columns, and boxes. If you do not rescan those units, you waste the value of the elimination.

When Candidate Elimination Becomes Essential

On easy puzzles, you can often solve with direct placement and light scanning. On medium and hard puzzles, candidate elimination becomes the main engine of progress.

You need it when:

• obvious singles stop appearing,
• several cells in a unit stay open at once,
• the puzzle depends on notes to expose restrictions.

At that point, the puzzle is no longer asking “what number fits here first?” It is asking “which candidate can be ruled out next?”

FAQ: How to Eliminate Candidates in Sudoku

What is candidate elimination in Sudoku?

Candidate elimination is the process of removing impossible digits from unsolved cells based on Sudoku rules or valid solving patterns.

How do you remove candidates without guessing?

Remove candidates only when a row, column, box, solved digit, or proven pattern such as a hidden single, locked candidate, or pair makes that digit impossible.

What should I check first when eliminating candidates?

Start by updating notes after each placement, then look for singles, locked candidates, and repeated candidate sets before moving to advanced strategies.

Do candidate eliminations always place a number right away?

No. Many eliminations simply reduce clutter, but that reduction often reveals the next forced move after a rescan.

Conclusion

How to eliminate candidates in Sudoku is really the skill of removing noise until the logic becomes visible. The best solvers do not force answers. They keep narrowing the board until the right answer is the only one left.

If you want faster, cleaner solves, focus on this sequence: accurate notes, careful eliminations, and immediate rescans. That rhythm will carry you much further than guessing ever will.

Call to action: Open a fresh puzzle on Pure Sudoku and spend one session doing nothing but note cleanup, locked candidates, and pair-based eliminations. You will start seeing why candidate elimination is the bridge between beginner solving and real Sudoku strategy.