pjaj,
I haven't really gotten my mind around coloring based on cycles yet either; however, there are many coloring-based eliminations that can be made based on what I consider easier coloring techniques, and with these you can quickly arrive at a solution
One semi-advanced coloring technique is called Multi-Colors by Simple Sudoko, which I believe simply refers to the fact that more than one conjugate chain is colored at the same time and the deductions are made accordingly.
Here's a great post by angusj on this subject
http://www.setbb.com/phpbb/viewtopic.php?p=2575&mforum=sudoku#2575Back to your puzzle, coloring on ths 7s in this sudoku yields the following:
- Code: Select all
. 7C . | . . 7c | . . .
. 7 7B | . . . | . 7a .
7 . . | . 7b 7 | . . 7A
----------|----------|-----------
. . . | . . . | . . .
7 7 . | . . 7b | . . .
. . 7b | . 7B . | . . .
----------|----------|-----------
. . . | . . . | . . .
. 7a . | . . . | . 7A .
7A . . | . . . | . . 7a
1) Take a look at the 7 in r3c1.
We can see that it is in the same row as the 7 at r3c5 (7b), and in the same box as the 7 at r2c3 (7B). Since r3c5 and r2c3 are opposite colors, one of them must be 7 so we can eliminate 7 as a candidate for r3c1.
2) Now take a look at aboxes 1 and 2
This is an example of what angusj calls Type 2b multi-coloring in the post I linked to above.
r1c2 (7C) and r2c3 (7B) cannot both be 7, therefore either B or C is false. This means that either 'b or 'c' must be true. Hence, one of r1c6 (7c) or r3c2 (7b) must be true. As a result, r3c6 must not be 7 and 7 can be eliminated here.
Note that the exact reverse logic can be used to eliminate 7 in r2c2. (And in fact it also eliminates 7 from r3c1 as well, even though we already did that in 1) )
3) Now that we've made some eliminations, we can recolor the 7s using only one conjugate chain as follows:
- Code: Select all
. 7- . | . . 7+ | . . .
. . 7+ | . . . | . 7- .
. . . | . 7- . | . . 7+
----------|----------|-----------
. . . | . . . | . . .
7- 7 . | . . 7- | . . .
. . 7- | . 7+ . | . . .
----------|----------|-----------
. . . | . . . | . . .
. 7- . | . . . | . 7+ .
7+ . . | . . . | . . 7-
From this we can see that in box 4, 7- appears twice (in r5c1 and r6c3). Since both of these cells cannot be 7, then '-' must represent the false condition and thus 7 can be eliminated from all cells marked '7-'. and conversely, all '7+' cells can be set to 7.
From here the puzzle solution is trivial.
In my opinion coloring can be an extremely powerful technique and you really only need to understand simple coloring on one chain and the multiple chain techniques outlined by angus, both of these just filtering on a single digit. With this coloring along with understansing x-wing, swordfish, and xy-wing, I've been able to solve all but the most difficult of puzzles.
If you haven't checked it out yet, Simple Suduko has a really nice interface for coloring and filtering on a single digit.
Cheers,
Jeff