R1C1 · Verified example
Teaching alias
Last Remaining Cell
Fill the only empty cell in a row, column, or box by identifying its missing digit.
Learn this techniqueSudoku technique library
Follow 12 learning topics from Last Remaining Cell and Candidate Notes through Singles, Locked Candidates, Pairs, Triples, X-Wing, XY-Wing, and Swordfish. The current proof engine executes 10 ranked techniques; the alias and candidate concept make those proofs easier to learn.
Learning order
Follow all 12 topics in learning order, while keeping the 10 ranked proof techniques distinct from the alias and candidate concept.
A learner-friendly pattern that maps to existing placement proofs.
A proof that places a forced digit in one cell.
The candidate notation shared by every ranked proof technique.
A proof that removes candidates without guessing a digit.
R1C1 · Verified example
Teaching alias
Fill the only empty cell in a row, column, or box by identifying its missing digit.
Learn this techniqueR5C5 · Verified example
Placement proof · Rank 1
Spot a cell whose legal candidate list has been reduced to one digit.
Learn this techniqueR1C7 · Verified example
Placement proof · Rank 2
Find the only cell in a row, column, or box that can contain a chosen digit.
Learn this techniqueR9C1 · Verified example
Candidate concept
Record and update only legal candidates so forced moves become easier to see.
Learn this techniqueR1C6 · Verified example
Candidate-elimination proof · Rank 3
When a candidate is confined to one line inside a box—or one box along a line—remove it from the intersecting peers.
Learn this techniqueR4C7 · Verified example
Candidate-elimination proof · Rank 4
Two cells in one unit share the same two candidates, so those digits can be removed from the unit’s other cells.
Learn this techniqueR8C7 · Verified example
Candidate-elimination proof · Rank 5
Two digits can appear in only the same two cells of a unit, so every other candidate can be removed from those cells.
Learn this techniqueR3C1 · Verified example
Candidate-elimination proof · Rank 6
Three cells contain non-empty subsets of the same three digits, so those digits can be removed from the unit’s other cells.
Learn this techniqueR3C2 · Verified example
Candidate-elimination proof · Rank 7
Three digits can appear only across the same three cells, so extra candidates can be removed from those pattern cells.
Learn this techniqueR3C6 · Verified example
Candidate-elimination proof · Rank 8
For one digit, two rows or columns place their candidates in the same two crossing lines, so that digit can be removed elsewhere on those lines.
Learn this techniqueR1C1 · Verified example
Candidate-elimination proof · Rank 9
A two-candidate pivot links XZ and YZ wings, allowing Z to be removed from every other cell that sees both wings.
Learn this techniqueR2C7 · Verified example
Candidate-elimination proof · Rank 10
For one digit, three base rows or columns confine their candidates to the same three crossing lines, creating exact deletions outside the pattern.
Learn this techniqueReview information
Every page derives its coordinates and candidate sets from a fixed or replayed board state. Placement and candidate-elimination steps additionally pass independent proof checks. Logic Coach on the game board remains Singles-only.