According to the "n digits sharing n cells" principle, all rows and columns can be finally reduced to a combination of naked subsets, ie. naked pair, naked triple, naked quad etc., provided that there are no contradictions resulted from the reduced combinations.
For example, in a row with 4 digits sharing 4 cells (naked quad):
If one cell is solved, then the row will be reduced to a naked triple.
If 2 cells are solved, then the row will be reduced to a naked pair.
Deductions can be made by examining all possible combinations of naked subsets in a row, column or a box and checking for contradictions.
- Code: Select all
Consider the following row with 4 unsolved cells:
+------------------+-----------------+---------------+
| 2 8 1 | 47 9 35 | 357 345 6 |
+------------------+-----------------+---------------+
The unsolved cells are 47-35-357-345
According to the "n digits sharing n cells" principle, the next reduced combination of naked subset is a naked pair with 2 unique digits. (a naked triple with 1 unique digit is not possible)
One of the possible naked pairs is r1c6=35 and the 35 content of r1c7. This makes the 7 in that cell redundant and it may be concluded that r1c7<>7.
One of the possible naked pairs is r1c6=35 and the 35 content of r1c8. This makes the 4 in that cell redundant and it may be concluded that r1c8<>4.
Checking for contradiction:
r1c7<>7 => r1c4=7, r1c6=35, r1c7=35 and r1c8=4
r1c8<>4 => r1c4=4, r1c6=35, r1c7=7 and r1c8=35
Multiple solutions, therefore there is no conclusion.
This example happened to have demonstrated a contradiction, namely multiple solutions. Please refer to Nick70's thread for workable examples.