TECHNIQUE
Aligned Pair Exclusion
A technique that considers the possible digit pairs in two cells and eliminates combinations that cannot coexist because of shared houses or variant constraints.
Reference
Sudoku terms, from A to Z.
The reference
This glossary collects the vocabulary used throughout Zero to Hero: grid structure, candidates, notation, logical relationships, solving techniques, puzzle construction, and common Sudoku variants.
Definitions are intentionally concise. When a term has a full lesson on Zero to Hero, the entry links you there.
Tip: Use the letter bar or search the glossary when a technique page introduces an unfamiliar term.
TECHNIQUE
A technique that considers the possible digit pairs in two cells and eliminates combinations that cannot coexist because of shared houses or variant constraints.
CONCEPT
A group of N unsolved cells in one house containing exactly N + 1 different candidates. An ALS is one candidate away from being a locked set.
Learn ALS →TECHNIQUE
A deduction using two ALS that share a Restricted Common Candidate X. A candidate Z common to both sets can be eliminated from cells seeing all Z occurrences in both ALS.
Learn this technique →TECHNIQUE
A chain in which strong and weak inferences alternate. AICs can connect candidates within cells, across houses, and through more advanced grouped structures.
Learn this technique →TECHNIQUE
A uniqueness-related rectangle involving two cells that can be completed with the same pair of digits. The deduction prevents a second solution while respecting the puzzle’s givens.
Learn this technique →GRID
One of the three horizontal groups of three boxes in a standard 9×9 Sudoku.
CANDIDATE
A candidate digit that appears in exactly two unsolved cells within a house. Those two occurrences form a strong link or conjugate pair.
Learn strong link →TECHNIQUE
A near-complete candidate pattern associated with uniqueness. In a pure BUG, every unsolved cell has exactly two candidates and every unsolved digit appears exactly twice in each relevant unit.
Learn this technique →SOLVING
A solving approach that temporarily assumes a candidate or value, follows its consequences, and uses contradiction or completion to determine whether the assumption can stand.
CANDIDATE
A cell with exactly two candidates remaining. Bivalue cells are central to techniques such as XY-Wing, XY-Chain, and Remote Pairs.
Learn strong link →TECHNIQUE
Another name commonly used for Claiming: a candidate restricted to one box-to-line intersection can be eliminated from the rest of the corresponding line.
Learn pointing and claiming →CONCEPT
The relationship between a box and a crossing row or column. Pointing and Claiming are deductions based on this interaction.
Learn pointing and claiming →TECHNIQUE
Abbreviation for Bi-value Universal Grave, a near-complete candidate pattern used in uniqueness reasoning.
Learn this technique →TECHNIQUE
A uniqueness technique for a grid that is one candidate beyond a Bi-value Universal Grave. The extra candidate is forced when the BUG structure would otherwise permit ambiguity.
Learn this technique →TECHNIQUE
A generalized BUG pattern containing two extra candidates beyond the pure BUG structure. Deductions depend on the placement and relationships of those extras.
Learn this technique →TECHNIQUE
A generalized BUG pattern containing three extra candidates beyond the pure BUG structure. It is a more specialized uniqueness deduction than BUG+1.
Learn this technique →CANDIDATE
A digit that is still possible in a cell. Candidate lists shrink as valid eliminations are made.
Learn candidate →SOLVING
The logical removal of a candidate because it cannot occur in a valid solution.
CANDIDATE
A pencil mark recording a possible digit in an unsolved cell. Candidate notes are used to expose patterns that are difficult to see from the givens alone.
GRID
One square of the Sudoku grid. In a standard Sudoku, each cell belongs to exactly one row, one column, and one box.
CONCEPT
A sequence of linked candidate states in which each inference constrains the next. Chains may be linear or closed into loops.
Learn chain technique →TECHNIQUE
A Locked Candidates pattern in which a digit’s candidates inside a box are confined to one row or column, allowing that digit to be eliminated from the rest of that line.
Learn this technique →GRID
A digit supplied in the original puzzle. Also called a given.
TECHNIQUE
A family of techniques that assigns alternating or grouped colors to linked candidates so contradictions and eliminations become visible.
GRID
One of the nine vertical units in a standard Sudoku.
CANDIDATE
Two occurrences of the same candidate in a house when no other occurrence of that candidate remains there. One must be true and the other false.
Learn strong and weak links →CONCEPT
A closed chain in which the strong and weak links alternate consistently all the way around the loop.
TECHNIQUE
A continuous loop whose alternating inferences allow deductions from the relationship between the links around the loop.
Learn chain technique →SOLVING
A state that cannot occur in a valid Sudoku solution, such as a cell with no candidates or two solved cells claiming the same digit in one house.
FISH
A row or column used to cover the candidate positions of a Fish. A Fish uses the same number of base sets and cover sets.
Learn fish technique →UNIQUENESS
A candidate arrangement that could support two or more solutions if left unresolved. Unique Rectangle techniques exploit this kind of pattern to preserve uniqueness.
GRID
One of the values 1 through 9 used in a standard Sudoku. In variant Sudoku, the symbol set may differ.
SOLVING
Reasoning about the consequences of placing or excluding a particular digit, often as part of a forcing chain.
TECHNIQUE
A forcing-chain approach that follows the consequences of an assumption about a particular digit.
CONCEPT
A closed chain whose links do not alternate uniformly at one point. Two strong links or two weak links at the break can produce different deductions.
SOLVING
The act of removing a candidate that cannot be the solution of a cell.
TECHNIQUE
A strong-link structure created when a candidate is absent from the intersection pattern of a box and one of its crossing lines. It can be used with another strong link to force an elimination.
Learn this technique →CHAIN
A cell or candidate at the end of a linear chain. In many chain techniques, both endpoints share a candidate that becomes the target of an elimination.
TECHNIQUE
A family of single-digit patterns based on candidate positions across base sets and cover sets. X-Wing, Swordfish, and Jellyfish are basic Fish.
Learn fish technique →TECHNIQUE
A method that follows the consequences of a candidate assumption through a chain until different branches converge on the same conclusion or one branch contradicts the puzzle.
TECHNIQUE
A house with exactly one unsolved cell remaining. The missing digit is forced immediately.
Learn this technique →GRID
A digit supplied by the puzzle and therefore fixed from the start. Also called a clue.
TECHNIQUE
Two digits that can occur in only the same two cells of a house. Other candidates can be removed from those two cells.
Learn this technique →TECHNIQUE
Four digits whose possible positions in a house are restricted to four cells. Other candidates can be eliminated from those cells.
Learn this technique →TECHNIQUE
A uniqueness pattern involving two candidate digits restricted to four cells arranged in a rectangle, with an additional candidate or relationship breaking the deadly pattern.
Learn this technique →TECHNIQUE
A digit that has only one possible cell within a house, even if that cell contains other candidates.
Learn this technique →TECHNIQUE
A group of digits confined to the same number of cells in a house. Hidden pairs, triples, and quads are examples.
TECHNIQUE
Three digits whose possible positions in a house are restricted to three cells. Other candidates can be eliminated from those cells.
Learn this technique →GRID
A row, column, or box. Each house in standard Sudoku contains the digits 1 through 9 exactly once.
Learn more →GRID
The shared cells between two houses, such as the cells where a row crosses a box. Intersections are central to Locked Candidates.
TECHNIQUE
A size-4 basic Fish: four base sets and four cover sets constrain one digit, allowing eliminations in the covered lines outside the base sets.
Learn this technique →TECHNIQUE
A basic completion technique: when eight digits of a house are placed, the remaining digit is forced into the final cell. Also called Full House.
Learn this technique →TECHNIQUE
Another name for Pointing: candidates for a digit inside a box are confined to one crossing line, allowing eliminations elsewhere on that line.
CANDIDATE
A candidate whose legal positions are restricted to an intersection between two houses, creating a Locked Candidates elimination.
TECHNIQUE
A family of intersection techniques in which a candidate is restricted to a line within a box, or to a box within a line. Pointing and Claiming are the two common forms.
Learn this technique →CONCEPT
A group of N cells containing exactly N different candidates, all confined to those cells within a house or valid set. Naked subsets are locked sets.
CHAIN
A closed chain with no meaningful start or end. X-Cycles and Nice Loops are examples of loop-based reasoning.
TECHNIQUE
A coloring technique that tracks more than one conjugate-pair chain of the same candidate and compares their color relationships for eliminations or contradictions.
PUZZLE
A puzzle state or puzzle with more than one valid completion. Standard Sudoku puzzles intended for solving are normally designed to have a unique solution.
TECHNIQUE
Two cells in a house containing the same two candidates and no others. Those two digits can be removed from other cells in the house.
Learn this technique →TECHNIQUE
Four cells in a house collectively containing only four candidates. Those four digits can be removed from other cells in the house.
Learn this technique →TECHNIQUE
A cell with exactly one candidate remaining. That candidate is forced.
Learn this technique →TECHNIQUE
A group of N cells containing only N distinct candidates. Naked pairs, triples, and quads are examples.
TECHNIQUE
Three cells in a house collectively containing only three candidates. Those candidates can be removed from other cells in the house.
Learn this technique →TECHNIQUE
A closed Alternating Inference Chain used to derive an elimination or placement from the relationships around the loop.
Learn this technique →TECHNIQUE
A contradiction-based solving method that assumes a candidate for a digit and follows enough consequences to show that the assumption cannot be true.
CHAIN
A candidate or grouped candidate state used as a point in a chain or loop.
CHAIN
A way of describing a candidate as true or false while tracing a chain. Strong and weak links determine how those states propagate.
GRID
Any other cell that shares a row, column, or box with a given cell. A cell cannot contain the same solved digit as any of its peers.
CANDIDATE
A written or displayed candidate note inside an unsolved cell.
CANDIDATE
Another spelling of Pencil Mark: a candidate note written in an unsolved cell.
WING
An endpoint cell in a Y-Wing or related wing structure that carries the shared elimination candidate.
SOLVING
The act of assigning a confirmed digit to a cell.
TECHNIQUE
A Locked Candidates pattern in which a digit’s candidates inside a box all lie in one row or column, allowing the digit to be eliminated from the rest of that line outside the box.
Learn this technique →PUZZLE
The complete Sudoku problem, including its givens and the rules that define a valid solution.
SUBSET
Informal shorthand for a group of four cells or four digits, commonly used when discussing Naked Quads or Hidden Quads.
SUBSET
Another term for a four-element subset, such as a Naked Quad or Hidden Quad.
TECHNIQUE
A general family of deductions using rectangular relationships among candidate cells; Unique Rectangles are the best-known uniqueness-based example.
GRID
Another name for a box in standard Sudoku, or a corresponding irregular region in a Sudoku variant.
TECHNIQUE
A chain of identical bivalue cells, typically {X,Y}, in which the alternating possibilities allow eliminations of X or Y from cells that see both ends.
Learn this technique →ALS
A digit shared by two ALS where every occurrence of that digit in one ALS sees every occurrence in the other. RCCs are the links that connect ALS structures.
Learn ALS →GRID
One of the nine horizontal units in a standard Sudoku.
GRID
Two cells see each other when they share a row, column, or box. A candidate in one cell therefore conflicts with the same digit in the other.
TECHNIQUE
A single-digit chain technique that colors candidates connected by conjugate pairs and uses the resulting color relationships to find contradictions or eliminations.
Learn this technique →TECHNIQUE
A cell or house situation in which one candidate is forced. Naked Single and Hidden Single are the two basic forms.
Learn chain technique →TECHNIQUE
A single-digit pattern formed by two strong links on the same candidate connected by a weak relationship, allowing an elimination from cells seeing both remote endpoints.
Learn this technique →PUZZLE
A complete valid assignment of digits to all cells satisfying every Sudoku constraint.
CHAIN
A relationship where two linked candidate states cannot both be false. If one is false, the other must be true.
CHAIN
A link between two candidate states with strong inference. In standard Sudoku it often comes from a bi-location or bi-value relationship.
Learn this technique →CONCEPT
A logic puzzle in which each required unit must contain a complete set of symbols without repetition. Standard Sudoku uses a 9×9 grid, digits 1–9, nine rows, nine columns, and nine 3×3 boxes.
Learn more →TECHNIQUE
A size-3 basic Fish: three base sets and three cover sets constrain one digit, allowing eliminations in the covered lines outside the base sets.
Learn this technique →PUZZLE
A visual or structural relationship in a Sudoku puzzle, such as rotational or reflection symmetry of the givens. Symmetry is optional and does not define a valid Sudoku.
SOLVING
A candidate or cell that is the intended destination of an elimination or inference. The term is especially common when explaining chain and wing deductions.
TECHNIQUE
A name sometimes used for patterns related to Two-String Kite or generalized single-digit strong-link structures. Terminology varies between Sudoku communities.
Learn this technique →SOLVING
A broad term for testing an assumption and following its consequences. Pure trial and error can become backtracking; disciplined contradiction-based methods can still be logically rigorous.
TECHNIQUE
A name used for a family of single-digit strong-link patterns that can be understood as short alternating chains, including structures related to Skyscraper and Two-String Kite.
Learn this technique →TECHNIQUE
A single-digit pattern combining two strong links and a weak connection across a row and column to force an elimination.
Learn this technique →UNIQUENESS
A loop-based uniqueness pattern in which a candidate arrangement would permit an alternative solution unless an additional candidate is removed.
Learn more →TECHNIQUE
A four-cell rectangle pattern in two rows and two columns that could otherwise permit two solutions. Different Unique Rectangle types use additional candidates to force an elimination.
Learn this technique →TECHNIQUE
A rectangle where three cells contain the same pair and the fourth cell contains that pair plus another candidate. The extra candidate is forced out to avoid the deadly pattern.
Learn this technique →TECHNIQUE
A uniqueness pattern in which the extra candidates in the rectangle are restricted so that one or more can be eliminated while preserving a unique solution.
Learn this technique →TECHNIQUE
A uniqueness pattern that uses an additional subset or candidate relationship in the rectangle’s extra cells to force eliminations.
Learn this technique →TECHNIQUE
A uniqueness pattern using a conjugate-pair relationship on one of the rectangle’s candidate digits to force an elimination.
Learn this technique →CONCEPT
The requirement that a standard Sudoku puzzle have one valid solution. Uniqueness techniques use that property as part of their proof.
TECHNIQUE
Another name sometimes used for Unique Rectangle. The rectangle exploits the assumption that the puzzle has a unique solution.
Learn this technique →GRID
A row, column, or box in standard Sudoku. Each unit must contain every digit 1–9 exactly once. Also called a house.
GRID
A cell whose final digit has not yet been determined. It may contain one or more candidates.
TECHNIQUE
A larger extended wing structure that can be understood through ALS-XZ logic. The name describes the size and candidate pattern; the ALS view provides the more general proof.
Learn this technique →TECHNIQUE
A wing structure using two matching bivalue cells connected by a strong link on one candidate. The other candidate can be eliminated from cells that see both bivalue cells.
Learn this technique →CHAIN
A relationship where two linked candidate states cannot both be true. If one is true, the other must be false.
CHAIN
A link expressing that two candidate states cannot both be true. Any two candidates that see each other form a weak relationship for the same digit.
Learn this technique →TECHNIQUE
A family of small candidate structures in which a pivot or connecting relationship forces a shared candidate in one or more wing cells. XY-Wing, XYZ-Wing, and W-Wing are examples.
Learn this technique →TECHNIQUE
An extended wing structure involving four cells and up to four digits. It can be interpreted as a compact ALS-XZ pattern, which gives the more general logical explanation.
Learn this technique →TECHNIQUE
A single-digit chain built from strong and weak links among occurrences of the same candidate. It can connect endpoints that are not directly related.
Learn this technique →CHAIN
A strong or weak relationship between two occurrences of the same candidate, used to build an X-Chain or X-Cycle.
Learn more →TECHNIQUE
A single-digit alternating inference loop. Continuous and discontinuous X-Cycles can produce different eliminations depending on how the loop closes.
Learn this technique →TECHNIQUE
A size-2 Fish in which a candidate is confined to two positions in each of two base rows or columns. The candidate can then be eliminated from the corresponding cover lines outside those base sets.
Learn this technique →TECHNIQUE
A chain of bivalue cells in which consecutive cells share a candidate and the endpoints share another candidate. That endpoint candidate can be eliminated from cells seeing both ends.
Learn this technique →TECHNIQUE
A closed XY-Chain of bivalue cells in which consecutive cells share a candidate and the chain loops back to the starting point.
Learn this technique →TECHNIQUE
A three-cell wing with a bivalue pivot {X,Y} and two bivalue wings {X,Z} and {Y,Z}. Z can be eliminated from cells seeing both wings.
Learn this technique →TECHNIQUE
A wing with a three-candidate pivot and two bivalue wings. A shared candidate can be eliminated from cells that see the pivot and both wings.
Learn this technique →TECHNIQUE
An older/general name for chains built from bivalue cells, especially structures that developed into the modern XY-Chain terminology.
Learn XY-Chain technique →TECHNIQUE
Another name for XY-Wing. The name is common in older and broader Sudoku literature.
Learn this technique →CANDIDATE
An arbitrary label for the candidate that is ultimately eliminated in a generalized wing or chain explanation. X, Y, and Z are placeholders, not fixed Sudoku digits.
SOLVING
A cell state in which no legal candidates remain. This is a contradiction in a valid Sudoku solving state and usually signals an invalid assumption or elimination.