Advanced Sudoku: Master the X-Wing and Swordfish techniques
Step beyond basic singles and pairs into advanced candidate geometry: understand the conjugate-pair logic that proves candidate eliminations across entire columns.
On this page
Transitioning from Local Clues to Geometric Linkages
When advancing past intermediate 9×9 Sudoku grids, players encounter a common plateau: candidate pencil notes populate every empty cell, yet there are no remaining naked singles, hidden singles, or straightforward pairs.
At this juncture, inspecting individual cells or single rows in isolation fails to advance the board. Solving requires shifting focus to multi-row and multi-column geometric interactions. The X-Wing pattern is the foundational breakthrough into advanced solving, relying not on guesswork, but on deterministic conjugate-pair logic.
Exact Definition and Structure of an X-Wing
An X-Wing pattern is defined by strict conditions: 1. Focus on a single candidate digit (let's say digit N). 2. Identify two base rows (e.g., Row 2 and Row 7) where candidate N appears in exactly two cells, and these cells share the exact same two columns (e.g., Column 4 and Column 8). 3. These four cells form the four vertices of a geometric rectangle.
Why is it called an X-Wing? Connecting opposite corners forms an 'X' diagonal. Because candidate N must appear once in each base row, only two mutually exclusive states can exist: - State A: Row 2 Column 4 holds N, and Row 7 Column 8 holds N. - State B: Row 2 Column 8 holds N, and Row 7 Column 4 holds N.
Try the matching board lesson, then return to your reading.
Open the practice boardThe Elimination Deduction: Clearing Entire Columns
Notice the decisive deduction: regardless of whether State A or State B occurs, both Column 4 and Column 8 are guaranteed to have their digit N placed inside one of the four vertices!
Under the fundamental rule that each column must contain digit N exactly once, no other cell in Column 4 or Column 8 can ever contain candidate N.
Therefore, we can safely eliminate candidate N from every other cell along Column 4 and Column 8 outside the four vertices. Rescan singles and pairs afterwards; an elimination need not immediately yield a placement. Candidate records must be complete and correct. This conditional row/column example is not a full puzzle grid.
Extending the Principle: Swordfish (Three-Unit Chains)
Mastering the 2-row × 2-column logic of the X-Wing unlocks seamless understanding of the Swordfish (3-row × 3-column) technique: - An X-Wing links 2 base rows across 2 common columns. - A Swordfish links 3 base rows across 3 common columns, where candidate N appears 2 to 3 times per row, strictly confined within those 3 columns. - The elimination outcome is identical: candidate N can be deleted from all other cells in those 3 columns outside the defining vertices.
When scanning grids, do not look aimlessly. Systematically filter candidates digit by digit from 1 to 9, identifying rows where a digit is confined to only two cells, immediately spotting conjugate pair alignments.
For example, a digit restricted to columns 2/5 in row 1, 5/8 in row 4 and 2/8 in row 7 must occupy those three columns in some order. Remove it from other rows in those columns. An extra candidate in column 9 of a base row breaks that restriction. Searching only rows with exactly two candidates misses Swordfish cases with three candidates in a row.
Pause and test your reasoning
In a row-based X-Wing pattern, where are the candidate eliminations performed?
Reveal the answer and reasoning
Along the two corresponding columns, in every cell other than the four defining rectangle vertices.
Continue learning
A correction is welcome. Include the section and the source you would like us to check. Contact the editor ↗
