Sudoku Glossary

Every term a solver meets, defined answer-first with a coordinate example. Standard Sudoku vocabulary first, then the Killer Sudoku terms — each definition links to a worked example or playable page.

Standard Sudoku terms

Cell
One of the 81 squares of the 9×9 Sudoku grid. Cells are addressed as R{row}C{col} — for example R4C7 is the cell in row 4, column 7. Worked example →
Row
A horizontal line of 9 cells, numbered R1 at the top to R9 at the bottom. Each row must contain the digits 1–9 exactly once.
Column
A vertical line of 9 cells, numbered C1 on the left to C9 on the right. Each column must contain the digits 1–9 exactly once.
Box (block, region)
One of the nine 3×3 sub-grids outlined on the board — top-left box, centre box, bottom-right box, and so on. Each box must contain the digits 1–9 exactly once.
Unit
Any complete group of 9 cells that must hold 1–9 once: a row, a column or a box. Most solving techniques reason about one unit at a time.
Peer
A cell that shares a row, column or box with another cell. R4C7's peers are every cell in row 4, column 7 and its 3×3 box — 20 cells in total.
Given (clue)
A digit printed on the board at the start. Givens are fixed and cannot be changed; difficulty roughly scales with how few givens a puzzle opens with.
Candidate
A digit that could legally occupy an empty cell after eliminating values already present in its row, column and box. Candidates are usually written as small pencil notes. Worked example →
Naked single
A cell with exactly one remaining candidate — that digit must go there. Example: if R4C7's only candidate is 6, placing 6 in R4C7 is a naked single. Worked example →
Hidden single
A digit that can only sit in one cell inside a unit, even though that cell shows several candidates. If 8 can go nowhere else in row 4, the only possible cell holds a hidden single. Worked example →
Naked pair
Two cells in the same unit holding exactly the same two candidates, like {3,8} and {3,8}. Those digits are locked to the pair, so they leave every other cell in the unit. Worked example →
Hidden pair
Two digits that can each only sit in the same two cells of a unit — even though those cells carry extra candidates. The pair's digits lock to the cells and the spare candidates are removed. Worked example →
Pointing pair (box–line reduction)
When every possible spot for a digit inside one box lies on a single row or column, the digit can be removed from that line outside the box. Worked example →
X-Wing
A digit confined to the same two columns across two rows (or the same two rows across two columns) forms a rectangle; the digit is eliminated from the rest of those lines. Worked example →
XY-Wing
Three bivalue cells — a pivot {x,y} and wings {x,z}, {y,z}. Whichever value the pivot takes, z is eliminated from every cell that sees both wings. Worked example →
Swordfish
The 3-line version of an X-Wing: a digit confined to the same three columns across three rows reserves those lines, clearing the digit elsewhere on them. Worked example →

Killer Sudoku terms

Cage
In Killer Sudoku, a dashed outline grouping cells whose digits must total the sum printed in the corner. Digits never repeat inside a cage. Worked example →
Cage combination
One legal set of distinct digits that sums to a cage's target — for example a 2-cell cage of 3 only admits {1,2}. Unique combinations solve a cage immediately. Worked example →
Rule of 45
Every row, column and box sums to 45. Subtracting fully-inside cage sums from 45 reveals the values of cells where a cage crosses the unit's border. Worked example →
Innie and outie
Cells where a Killer cage crosses a unit boundary: an innie is the cage's cell inside the unit, an outie is the one outside. The Rule of 45 can solve single innies and outies directly. Worked example →

Keep learning