Foundation · Sudoku Pro
Build a trustworthy candidate ledger
Check every pencil mark against all three Sudoku units before using it in a deduction.
Partial candidate illustrations, not complete solved Sudoku boards. Verify candidate restrictions on a real grid before eliminating.
1. Compute a cell instead of guessing
For an empty cell, start from digits 1–9 and cross out every digit already present in its row, column, and 3×3 box. The remaining set—not a visual impression—is the cell’s legal candidate list. Every elimination must be justified by one of those units or by a proved pattern involving other candidates.
2. A deliberately unresolved example
Suppose r4c5 sees 1, 2 and 3 in its row; 4 and 6 in its column; and 7 and 8 in its middle box. The union of forbidden digits is {1,2,3,4,6,7,8}, leaving {5,9}. That is a two-candidate cell, not a solved cell. Writing 5 immediately would be guessing.
3. Keep notes consistent
When you place a proved 5 elsewhere, erase 5 only from cells that see that placement. Recalculate any affected row, column, or box rather than clearing every 5 in the puzzle. If an empty cell has no candidates, undo the last questionable action and audit the grid for a contradiction.
4. A practical audit routine
Choose one row, scan its nine cells, and check each note against the corresponding column and box. Repeat after every meaningful placement. This routine separates a missing candidate—an error in the notes—from an actual exclusion by Sudoku logic. Only after the ledger is consistent should you search for hidden singles and pairs.
Check your understanding
With r4c5 still allowing {5,9}, can you enter 5 solely because it is the smaller candidate?
Open the explained answer
No. Both digits satisfy the stated local constraints. You need an additional valid deduction before placing either.
This self-check requires no account and sends no answers to a server.
Deeper practical examples and reasoning
Treat the ledger as an audit trail. After placing one digit, revisit the row, column and box it touches; erase only candidates invalidated by that placement. If a pencilled candidate disappears, be able to name the constraint that removed it.
Audit one row as if it were a small proof
Imagine row 4 is missing digits 2, 5 and 8. For each empty cell, inspect its column and box and list only the digits not already present. Suppose r4c2 allows {2,5}, r4c6 allows {2,8}, and r4c8 allows {5,8}. This does not yet prove which cell gets which value, but it does give an accurate map of the three unresolved positions. When an external deduction eliminates 2 from r4c2, that cell becomes 5; only then can the rest of the row be updated. A well-maintained candidate ledger records both possibilities and the reasons they disappear.
Distinguish an empty note from an excluded digit
If the grid contains r4c5 with no handwritten pencil mark, the absence of a note is not evidence that the corresponding digit is illegal. A candidate is excluded only when a placed digit in a relevant unit or a verified technique forbids it. Check your notes whenever a pattern seems to depend on a missing candidate. Writing down a false exclusion can create an apparent hidden single that never truly existed.