Intersections, subsets and fish
Locked candidates, naked and hidden subsets, and fish described through their objects, base sectors and cover sectors.
Pointing
Box-to-line candidate restriction and elimination.
Continue Reading
Claiming
Line-to-box candidate restriction and elimination.
Continue Reading
Hidden Pair
Two digits restricted to two cells in one house.
Continue Reading
Naked Pairs
Two matching two-candidate cells that eliminate peers.
Continue Reading
X-Wing
A two-row or two-column fish construction.
Continue Reading
Naked Triplet
Three cells containing only three combined candidates.
Continue Reading
Hidden Triplet
Three digits confined to three cells in one house.
Continue Reading
Swordfish
A three-row or three-column fish construction.
Continue ReadingCandidate restrictions across Sudoku houses
A locked set balances N objects with N possibilities. In the RC view, N cells have a union of N candidate digits: a naked set removes those digits elsewhere in the sector. In the positional RN, CN, or BN views, N digits have a union of N positions in a row, column, or box: a hidden set removes other digits from those positions. Pointing and Claiming are size-one base-and-cover intersections.
X-Wing and Swordfish extend that logic across several rows and columns. An X-Wing confines one digit to the same two columns in two rows (or the transposed arrangement), while a Swordfish uses three base houses and three cover houses. The eliminations are valid because the selected digit must occupy the construction’s cover positions. Studying these methods together makes the shared structure visible and prepares solvers for larger fish and more complex candidate networks.