Sudoku Solver — Step by Step, Every Technique Explained
The only solver that teaches you how — not just what the answer is
Enter any Sudoku puzzle and watch it get solved one step at a time, with every move explained in plain English. Covers all 16 standard techniques: Naked Single, Hidden Single, Naked Pair, Hidden Pair, Naked Triple, Pointing Pair, X-Wing, Swordfish, XY-Wing, XYZ-Wing, Unique Rectangle, BUG+1, W-Wing, Nishio, and Forcing Chains.
▸ About the techniques & how the solver works
Tier 1 — Basic techniques
Naked Single: Only one digit can go in a cell — everything else is blocked by its row, column, or box. Hidden Single: A digit can only go in one cell within a row, column, or box, even if that cell has other candidates.
Tier 2 — Intermediate techniques
Naked Pair/Triple: Two or three cells sharing the same candidates lock those digits within a unit. Hidden Pair: Two digits that can only go in two cells force out all other candidates from those cells. Pointing Pair: If a digit in a box is confined to one row or column, it can be eliminated from that line outside the box.
Tier 3 — Advanced techniques
X-Wing: A digit confined to the same two columns across two rows can be eliminated from all other cells in those columns. Swordfish: The same principle across three rows and three columns. XY-Wing: A three-cell chain where both wings must contain the same digit — eliminating it from cells that see both wings. XYZ-Wing: A four-candidate variation of XY-Wing.
Tier 4 — Expert techniques
Unique Rectangle (Gordonian Rectangle): Uses the uniqueness constraint — a pattern that would give two solutions is impossible, so the digit breaking it is forced. BUG+1: When every cell has two candidates except one with three, logic forces the answer. W-Wing: Two bivalue cells connected by a strong link force eliminations in cells that see both.
Tier 5 — Diabolical techniques
Nishio: Assume a candidate is placed; if it causes a contradiction after propagation, eliminate it. Forcing Chains: Test both options of a bivalue cell — if both branches agree on an outcome, that outcome is certain. Bifurcation: A guided guess on the cell with fewest options, used only when all logic is exhausted.