I may have set out to prove one theory and hit upon another.
- Code: Select all
*-----------------------------------------------------------*
| 5 6 279 | 47 39 1 | 249 349 8 |
| 2479 248 1279 | 5 39 478 | 6 1349 1249 |
| 349 348 139 | 48 6 2 | 5 7 149 |
|-------------------+-------------------+-------------------|
| 367 9 37 | 2 47 5 | 1 8 467 |
| 27 25 4 | 68 1 68 | 3 59 579 |
| 16 15 8 | 3 47 9 | 47 2 56 |
|-------------------+-------------------+-------------------|
| 1234 7 6 | 9 8 34 | 24 145 1245 |
| 1349 134 5 | 467 2 3467 | 8 1469 1479 |
| 8 24 29 | 1 5 467 | 2479 469 3 |
*-----------------------------------------------------------*
Theorem: In a unit (row, column, or box) consisting of double instances (i.e. no more than two occurances per box) of the various candidates except for a single cell which has an extra (third) instance of a candidate, that candidate can be excluded from that cell -- except when the candidate is also "extra" in 2 intersecting units! e.g. the same digit is a third instance simultaneously in a box, row, and column: then it is FORCED to be that value, by the BUG rules.)
IF this is valid we may proceed as follows:
exclude 7 from r4c1 (box 4)
exclude 4 from r2c6 (box 2)
exclude 7 from r4c9 (row four)
exclude 5 from r5c9 (row five)
exclude 4 from r8c4 (column four)
and the rest is solved by 1 instance of multi-colors followed by 48 instances of naked or hidden singles!
Comments, refutations?
Havard's excellent post on strong links may have been in the back of my mind here.