EnderGT wrote:Knowing that there's much debate as to the acceptability of uniqueness tests, and that the claim is made that any puzzle can be solved without depending on them, I'm curious to see how this puzzle would be solved without applying the obvious BUG removal.
- Code: Select all
6 45 2 | 37 347 1 | 57 8 9
3 15 7 | 8 2 9 | 4 15 6
8 14 9 | 5 4-7 6 | 2 d17 3
----------------+----------------+---------------
1 2 3 | 4 8 7 | 6 9 5
4 9 8 | 2 6 5 | 1 3 7
5 7 6 | 9 1 3 | 8 2 4
----------------+----------------+---------------
7 68 4 | 13 35 2 | 9 56 18
2 68 5 | 17 9 4 | 3 c67 18
9 3 1 | 6 a57 8 |b57 4 2
Candidates 2 & 9 have been resolved, so they can't contribute any further. Candidates 1,3,4,5,6 & 8 have two candidates only in each row/column/box, so none of them can individually lead to any further eliminations.
This leaves Candidate 7 and
hobiwan's Skyscraper -- or a 2-String Kite (shown above), or an Empty Rectangle (not shown), or any of 50 finned X-Wings (not shown) -- for eliminations based on a single candidate.
I agree with
hobiwan, I like the BUG+1.