- Code: Select all
*-----------------------------------------------------------*
| 5 16 7 | 2 9 16 | 3 4 8 |
| 2 168 3 | 4 578 168 | 156 17 9 |
| 4 168 9 | 15 578 3 | 1256 127 57 |
|-------------------+-------------------+-------------------|
| 1 5 6 | 7 2 4 | 8 9 3 |
| 9 7 2 | 8 3 5 | 4 6 1 |
| 8 3 4 | 19 6 19 | 7 5 2 |
|-------------------+-------------------+-------------------|
| 3 2 15 | 6 4 89 | 159 178 57 |
| 7 4 15 | 359 58 2 | 159 138 6 |
| 6 9 8 | 35 1 7 | 25 23 4 |
*-----------------------------------------------------------*
At this point I ask Simple Sudoku for a hint and it tells me I can make an elimination in r3c4 based on "Multiple Colors"
I have looked at this and see nothing interesting on the 1's.
On the 5's I see three independent conjugates that don't seem to be chained to any others
1) [r2c5]=5=[r2c7] (Is this notation correct?)
2) [r3c9]=5=[r7c9] (I guess r3c9 is technically "weak linked" to r2c7)
3) [r9c7]=5=[r9c4] (and here r9c7 is "weak linked" to r7c9)
I'm not sure, but it seems this may be an example of a forcing chain, nice loop or other related technique in this family which I haven't mastered yet.
However, I thought I had a pretty good handle on coloring, and I don't see how we make a coloring-based elimination here. (I will look into applying the other techniques on my own as an exercise, but I'm most interested in how "multiple colors" applies to this example.)
Thanks,
Jeff