Learn / Coloring and chains
Sudoku technique · Coloring and chains · first needed in Expert puzzles
Simple coloring: wrap
If two same-colored candidates conflict, that color cannot be true anywhere in this connected component.
How to spot it
Look for a repeated color in one row, column, or box.
The common mistake
Do not propagate the result into a disconnected coloring component.
Learn this first
Simple coloring: trap.
A worked example
This position comes from SudokuByte’s lesson on the Simple coloring: wrap. Gold cells hold the evidence; green cells are the pattern’s ends.
256
2458
4568
7
1
23589
3469
24569
23459
1257
3
158
6
4
2589
179
1259
2579
12567
9
1456
23
23
235
13467
8
23457
2359
258
3589
23489
23689
1
34689
7
23489
4
6
7
5
2389
2389
1389
129
2389
1239
128
1389
23489
236789
234689
5
12469
23489
1379
147
1349
13489
5
3489
2
49
6
15679
1457
2
1489
689
4689
4789
3
45789
8
45
34569
2349
2369
7
49
459
1
256
2458
4568
7
1
23589
3469
24569
23459
1257
3
158
6
4
2589
179
1259
2579
12567
9
1456
23
23
235
13467
8
23457
2359
258
3589
23489
23689
1
34689
7
23489
4
6
7
5
2389
2389
1389
129
2389
1239
128
1389
23489
236789
234689
5
12469
23489
1379
147
1349
13489
5
3489
2
49
6
15679
1457
2
1489
689
4689
4789
3
45789
8
45
34569
2349
2369
7
49
459
1
Where to look
Look for a repeated color in one row, column, or box.If two same-colored candidates conflict, that color cannot be true anywhere in this connected component.
Read the evidence in this position
For digit 7, connected strong links produce two alternating groups. Teal: r7c1, r8c2. Gold: r7c2.Why the deduction must follow
r7c1, r8c2 have the same color but see one another. They cannot both be 7; therefore that color is false throughout this connected component. Remove every candidate of that color.Apply the result
Erase 7 from r7c1, r8c2. The pattern may remove candidates without immediately solving a cell.
Further reading: hodoku.sourceforge.net