First off, you have a Naked Single in [r6c2]=2. After you set it, there are two obvious ways to solve this puzzle.
- Code: Select all
*-----------*
|.8.|213|47.|
|...|457|18.|
|174|968|352|
|---+---+---|
|..7|824|961|
|891|536|724|
|426|791|835|
|---+---+---|
|943|672|518|
|7..|189|.43|
|.18|345|.97|
*-----------*
*--------------------------------------------------*
| 56 8 59 | 2 1 3 | 4 7 69 |
| 236 36 29 | 4 5 7 | 1 8 69 |
| 1 7 4 | 9 6 8 | 3 5 2 |
|----------------+----------------+----------------|
| 35 35 7 | 8 2 4 | 9 6 1 |
| 8 9 1 | 5 3 6 | 7 2 4 |
| 4 2 6 | 7 9 1 | 8 3 5 |
|----------------+----------------+----------------|
| 9 4 3 | 6 7 2 | 5 1 8 |
| 7 56 25 | 1 8 9 | 26 4 3 |
| 26 1 8 | 3 4 5 | 26 9 7 |
*--------------------------------------------------*
The first is an XY-Wing from [r1c2]=56 to [r2c2]=36 and [r1c4]=35 to get [r4c2]<>3. The second is to notice that it's a BUG+1 -- all the cells have 2 candidates except [r2c1]=236 (the +1 cell). If you take each candidate in [r2c1] and see how often each occurs in [r2c1]'s row+column+box, then the candidate with the largest count will be the cell value. In this case, <6> has the highest count.