Naked Subsets

What Are Naked Subsets in Sudoku?

A naked subset is a group of N cells within a single house (row, column, or block) whose combined candidates contain exactly N distinct digits. Because those N digits must fill those N cells, they cannot appear in any other cell in that house. This lets you safely eliminate those digits from the remaining cells. The word "naked" means the candidates are fully visible and exposed. You do not need to search for digits that are hidden among other candidates. The subset announces itself plainly through the pencil marks in those cells. There are four naked subset techniques, one for each possible group size: - Naked Single (N=1) -- one cell with one candidate - Naked Pair (N=2) -- two cells whose combined candidates are exactly two digits - Naked Triple (N=3) -- three cells whose combined candidates are exactly three digits - Naked Quad (N=4) -- four cells whose combined candidates are exactly four digits These four techniques form a family. They share the same underlying logic and differ only in the number of cells involved. Once you understand the core principle, the larger subsets become natural extensions of the simpler ones.

The Core Principle: Why Naked Subsets Work

The logic behind naked subsets rests on a fundamental counting argument sometimes called the pigeonhole principle. In plain language: if you have N slots and exactly N items to fill them, each item goes in exactly one slot, and no other items can occupy those slots. Consider a row with nine cells. Each unsolved cell has a set of candidate digits, the pencil marks that could still legally go in that cell. Suppose you find two cells in that row whose candidates are both drawn from the same two-digit pool, say {4, 6}. One of those cells must contain 4 and the other must contain 6. There is no room for any other arrangement. This means no other cell in the row can contain 4 or 6, because both digits are fully accounted for by those two cells. The same reasoning scales up. Three cells whose combined candidates total exactly three digits lock those three digits into those three cells. Four cells with four combined candidates lock all four digits. In every case, the locked digits can be eliminated from all other cells in the shared house. This principle applies identically whether the house is a row, a column, or a 3x3 block. The only requirement is that all N cells belong to the same house.

Naked Single: The Foundation of Sudoku Solving

A naked single is the simplest possible naked subset. It occurs when a cell has only one candidate remaining in its pencil marks. Since there is only one digit that can legally go in that cell, that digit is the solution for the cell. Every Sudoku solver, whether human or algorithmic, relies on naked singles. They are the final step in the chain of elimination: after all the constraints from the row, column, and block have removed impossible digits, the last remaining candidate is the answer. Finding a naked single requires you to track the pencil marks for each cell carefully. A cell starts with up to nine possible candidates. As you place digits elsewhere on the board, candidates are eliminated: - If a digit is placed anywhere in the same row, remove it from the cell's candidates. - If a digit is placed anywhere in the same column, remove it from the cell's candidates. - If a digit is placed anywhere in the same 3x3 block, remove it from the cell's candidates. When these eliminations reduce a cell to a single candidate, you have found a naked single. Consider cell R5C3 in a partially solved puzzle. The row, column, and block constraints eliminate the following digits: - Row 5 already contains: 1, 3, 5, 8 - Column 3 already contains: 2, 6, 9 - Block 4 (the middle-left block) already contains: 7 Combined, the digits 1, 2, 3, 5, 6, 7, 8, and 9 are all eliminated. The only remaining candidate is 4. Cell R5C3 must be 4. This is a naked single. Naked singles should be your first check after every move. Each time you place a digit, it may reduce neighboring cells to a single candidate. In easier puzzles, chains of naked singles can solve large portions of the board without any other technique. Even in harder puzzles, naked singles clean up the board after more advanced techniques eliminate candidates.

Naked Pair: Two Cells, Two Candidates, Powerful Eliminations

A naked pair occurs when two cells in the same house each contain exactly the same two candidates and no other candidates. Since those two digits must go in those two cells, you can eliminate both digits from every other cell in that house. Naked pairs are one of the most commonly applied intermediate Sudoku strategies. They appear frequently and often unlock significant progress by removing candidates that block other techniques. Suppose two cells in row 1 both contain the candidates {4, 6} and no other candidates: - R1C2 has candidates: {4, 6} - R1C7 has candidates: {4, 6} One of these cells will be 4 and the other will be 6. We do not know which is which yet, but we know for certain that 4 and 6 are fully consumed by these two cells. Therefore, no other cell in row 1 can contain 4 or 6. If R1C4 had candidates {3, 4, 6, 9}, it can be reduced to {3, 9} by removing 4 and 6. If R1C8 had candidates {2, 6}, it can be reduced to {2}. That reduction to a single candidate is itself a naked single, which solves the cell immediately. Scan each house for cells with exactly two candidates. When you find two cells in the same house with identical two-candidate sets, you have a naked pair. Since cells with only two pencil marks stand out visually, naked pairs are among the easiest intermediate techniques to spot. A useful habit: whenever you notice a cell with only two candidates, immediately check whether any other cell in the same row, column, or block shares the same pair.

Naked Triple: Three Cells, Three Candidates, a Subtle Twist

A naked triple occurs when three cells in the same house have candidates drawn entirely from the same pool of exactly three digits. The combined set of all candidates across the three cells contains exactly three distinct digits. Here is the key insight that catches many solvers off guard: each individual cell does not need to contain all three digits. A valid naked triple can include cells with only two of the three digits. What matters is that the union of all candidates across the three cells totals exactly three distinct values. Many players learn naked pairs first and then assume naked triples require three cells each containing the same three candidates, like {1, 3, 7} in all three cells. While that is one valid form of a naked triple, it is not the only one and not even the most common one. Consider these three cells in column 5: - R2C5: {1, 3} - R4C5: {1, 7} - R8C5: {3, 7} The combined candidates are {1, 3, 7}, which is exactly three digits in three cells. This is a valid naked triple, even though no single cell contains all three digits. The logic is the same as with naked pairs. These three digits must fill these three cells in some order. One cell gets 1, one gets 3, one gets 7. Therefore, 1, 3, and 7 can be eliminated from every other cell in column 5. Start by identifying cells with two or three candidates. In a given house, if you find three cells whose combined candidates form a set of exactly three digits, you have a naked triple. A practical approach: 1. In each house, list all unsolved cells with three or fewer candidates. 2. Pick any combination of three such cells. 3. Take the union of their candidates. If the union has exactly three digits, it is a naked triple. Because there are multiple possible combinations, naked triples require more careful scanning than naked pairs. This is part of what makes them a higher-difficulty technique.

Naked Quad: Four Cells, Four Candidates, Maximum Complexity

A naked quad is the largest commonly used naked subset. It occurs when four cells in a house have candidates drawn entirely from the same pool of exactly four digits. As with triples, individual cells do not need to contain all four digits. The critical condition is that the union of candidates across all four cells equals exactly four distinct values. The logic is identical to smaller naked subsets. Four digits must fill four cells. Those digits cannot appear anywhere else in the house. Naked quads are rarely found by casual scanning. With four cells and four digits, there are many more possible combinations to check. In a house with six unsolved cells, there are 15 possible ways to choose four of them. Checking each combination mentally is tedious. Most solvers who find naked quads do so either through systematic checking or by first spotting that the remaining cells form a complementary hidden subset. Despite their rarity, naked quads do appear in real puzzles, especially those rated at moderate to challenging difficulty. Having the technique in your repertoire ensures you are not stuck when simpler techniques have been exhausted.

How to Spot Naked Subsets: Practical Scanning Tips

Finding naked subsets efficiently requires a structured approach rather than random scanning. Here are techniques that experienced solvers use: Start With Small Candidate Counts: Cells with fewer candidates are more likely to participate in naked subsets. A cell with two candidates can be part of a pair, triple, or quad. A cell with five candidates is less useful because it contributes too many digits to the union. Scan each house for cells with two candidates first. Check for matching pairs. Then look at cells with two or three candidates together to find triples. Work House by House: Pick a row, column, or block and examine all its unsolved cells together. List their candidates. Look for clusters of cells whose candidates overlap within a small digit pool. Use the Counting Check: For any group of N cells you suspect might form a naked subset, count the distinct digits in their combined candidates. If the count equals N, you have found a naked subset. If the count exceeds N, those cells are not a naked subset. Check After Every Elimination: When another technique removes candidates from a cell, recheck that cell's house. The elimination may have created a new naked subset that was not visible before. Many naked pairs emerge as a side effect of earlier eliminations. Look for the Complement: If a house has K unsolved cells and you suspect a naked subset exists but cannot find it directly, try looking at the complement. Finding a hidden subset of size M automatically implies a naked subset of size K - M.

The Relationship Between Naked Subsets and Hidden Subsets

Naked subsets and hidden subsets are two sides of the same coin. Understanding their duality deepens your grasp of Sudoku logic and can help you find patterns you might otherwise miss. A hidden subset occurs when N digits in a house appear only within N specific cells. The digits are "hidden" because those cells may also contain other candidates. The elimination removes the extra candidates from those N cells, leaving only the hidden digits. In any house with K unsolved cells, if there is a naked subset of size N, there is automatically a hidden subset of size K - N. The two subsets are complementary: they partition the unsolved cells and the remaining digits into two non-overlapping groups. For example, consider a row with 6 unsolved cells. If two of those cells form a naked pair, the remaining four cells form a hidden quad (or equivalently, a naked quad exists among those four cells' excluded digits). You can find either one and apply the corresponding eliminations. This duality means you have two paths to the same elimination. If a house has many unsolved cells, a small naked subset (pair or triple) is easier to spot than a large hidden subset. Conversely, if a house has few unsolved cells, a hidden pair might be easier to find than searching for the complementary naked quad. Experienced solvers switch between naked and hidden perspectives depending on which is more practical in a given situation. The ability to see both sides gives you a significant advantage.

Difficulty Progression: From Beginner to Advanced

The four naked subset techniques span several difficulty levels, reflecting how much harder they are to find as the group size increases: Naked Single (N=1): Level 2, Easy Naked Pair (N=2): Level 3, Easy Naked Triple (N=3): Level 4, Moderate Naked Quad (N=4): Level 5, Challenging The difficulty increase is not about the logic, which is identical in every case, but about the search complexity: Naked Single: You only need to check one cell. If it has one candidate, you are done. No combination search is required. Naked Pair: You need to find two cells with matching candidates. In a house with six unsolved cells, there are 15 possible pairs to check. But since you are looking for cells with exactly two identical candidates, the visual pattern is distinctive and easy to recognize. Naked Triple: You need to find three cells whose combined candidates total three digits. In a house with six unsolved cells, there are 20 possible triples. The search is harder because the cells do not need to have identical candidate sets. Naked Quad: You need to find four cells from potentially many unsolved cells. The number of combinations grows, and four-digit unions are harder to compute mentally. Most quads are found indirectly, either through systematic candidate counting or by spotting the complementary hidden pair. Puzzle difficulty ratings often depend on which techniques are required to solve them. A puzzle that needs nothing beyond naked singles and pairs is rated as easy. A puzzle requiring naked triples enters moderate territory. A puzzle that demands a naked quad is at least challenging.

Common Mistakes and How to Avoid Them

Mistake 1: Expecting All Cells to Contain All Digits The most common error with naked triples and quads is assuming every cell in the subset must contain all N digits. This is wrong. A naked triple with cells {1,3}, {1,7}, and {3,7} is perfectly valid even though no cell contains all of 1, 3, and 7. How to avoid it: Always check the union of candidates, not individual cells. Count the distinct digits across all cells in the group. If the count equals the number of cells, it is a naked subset regardless of how the digits are distributed among the individual cells. Mistake 2: Confusing Naked and Hidden Subsets A naked pair has N cells with candidates limited to N digits. A hidden pair has N digits limited to N cells, but those cells may have additional candidates. With a naked pair, you eliminate the pair's digits from other cells in the house. With a hidden pair, you eliminate the non-pair digits from the pair's own cells. How to avoid it: Ask yourself: "Am I looking at cells with restricted candidates (naked) or digits with restricted locations (hidden)?" The direction of the restriction determines which type of subset you have found. Mistake 3: Eliminating From the Wrong Cells When you find a naked pair {4, 6} in cells R1C2 and R1C7, you eliminate 4 and 6 from the other cells in row 1. You do not eliminate other candidates from R1C2 and R1C7 themselves. The naked pair's candidates remain intact in the subset's own cells. How to avoid it: Remember the rule: naked subsets eliminate their digits from cells outside the subset. Hidden subsets eliminate non-subset digits from cells inside the subset. Mistake 4: Forgetting to Check All Shared Houses Two cells might share more than one house. For instance, R1C1 and R1C3 share both row 1 and block 1. If they form a naked pair, you can eliminate the pair's digits from other cells in row 1 and from other cells in block 1. Do not limit your eliminations to just one house. How to avoid it: For every naked subset you find, check which houses all the subset's cells share. Apply eliminations in every shared house.

When to Use Naked Subsets in Your Solving Workflow

Naked subsets should be checked in order from smallest to largest: 1. Naked Singles first. After every placement, scan for new naked singles. They are free and immediate. 2. Naked Pairs second. Once no more naked singles remain, scan for naked pairs in every row, column, and block. They are the most common intermediate technique and frequently unlock further naked singles. 3. Naked Triples third. When pairs are insufficient, widen your search to triples. Focus on houses where several cells have two or three candidates. 4. Naked Quads last. Only search for quads when smaller subsets and other techniques have been exhausted. Given their difficulty, consider checking for hidden pairs or triples first, as they may be easier to find and reveal the same information through the duality principle. By following this progression, you apply the easiest and most productive techniques first, saving mental effort for when it is truly needed.

Summary

Naked subsets are a family of four Sudoku techniques unified by a single elegant principle: N cells in a house with exactly N combined candidates lock those digits in place, allowing you to eliminate them from all other cells in the house. From the humble naked single that solves a cell outright, through naked pairs and triples that clear away candidates, to the elusive naked quad that demands careful systematic searching, these techniques form a backbone of logical Sudoku solving. Mastering them gives you reliable tools that apply to puzzles at every difficulty level and builds the foundation for tackling even more advanced strategies like hidden subsets, fish patterns, and chains.