Wapati wrote:This one was odd for me. I didn't know what BUG2 was. I don't like it but it can be used here. I used finned-x, finned-sword and BUG1.
- Code: Select all
*------------------------------------------------------*
| 6 7 59 | 2 3459 349 | 8 349 1 |
| 1 49 2 | 8 349 6 | 345 7 3459 |
| 45 8 3 | 7 1 459 | 6 49 2 |
|----------------+------------------+------------------|
| 45 19 8 | 3 2 7 | 145 6 459 |
| 7 46 56 | 9 58 1 | 34 2 348 |
| 3 2 19 | 4 6 58 | 7 189 589 |
|----------------+------------------+------------------|
| 8 5 7 | 16 34 2 | 9 134 346 |
| 2 136 16 | 5 3489 3489 | 134 1348 7 |
| 9 13 4 | 16 7 38 | 2 5 368 |
*------------------------------------------------------*
R8c2=1 or r8c8=1, and so r8c3/r8c7<>1. After that: r8c5=9 or r7c9=6 but if r8c5~9 then r8c2=1 => r9c2=3 => r9c9=6. So r8c5=9.
Wapati wrote:UR and 3 patterns.
- Code: Select all
*------------------------------------------------------------*
| 359 6 8 | 7 135 19 | 135 4 2 |
| 359 1 7 | 4 35 2 | 8 6 359 |
| 2 4 59 | 136 8 169 | 1357 357 13579 |
|------------------+-------------------+---------------------|
| 1 7 2 | 9 4 5 | 36 8 36 |
| 4 9 6 | 8 17 3 | 2 57 157 |
| 8 5 3 | 2 6 17 | 17 9 4 |
|------------------+-------------------+---------------------|
| 567 2 4 | 36 9 67 | 3567 1 8 |
| 679 3 19 | 5 127 8 | 4 27 67 |
| 567 8 15 | 136 1237 4 | 9 2357 3567 |
*------------------------------------------------------------*
Consider the sets A=[r89c8] and B=[r89c9], and note how they cannot be locked at the same time on 2,7 and 6,7, respectively. But, if r9c3=5 then r9c5=3 and now both A and B are locked. So, r9c3<>5 which solves the puzzle.
Carcul