http://forum.enjoysudoku.com/200e200w-s-weekly-extreme-2-t34498.html#p264661
Question 1) My step 12 is actually two AICs but so closely related that I didn't feel like writing them separately. Is such an "extended" or "double" AIC valid and does it count as one or two moves? Here's the situation:
- Code: Select all
+-------------------+-------------------+------------------+
| 1 a7(8)-9 579 | 5689 g(4)5-8 2 | 3 67 fg4(9) |
| 23 4 279 | 69 1 36 | 68 5 78 |
| 58 39 6 | 7 34 58 | 1 49 2 |
+-------------------+-------------------+------------------+
| 3567 13679 8 | 15 2 4 | 56 3679 13579 |
| 24567 1267 457 | 3 58 9 | 2568 267 1578 |
| 235 1239 59 | 158 6 7 | 4 23 13589 |
+-------------------+-------------------+------------------+
| 9 b268 24 |c2568 358 1 | 7 234 35 |
| 246 5 1 | 26 7 d36 | 9 8 e34 |
| 278 27 3 | 4 9 58 | 25 1 6 |
+-------------------+-------------------+------------------+
My "Extended-AIC": (8)r1c2 = (8-6)r7c2 = r7c4 - (6=3)r8c6 - (3=4)r8c9 - r1c9 = ((9)r1c9 & (4)r1c5) => -9 r1c2, -8 r1c5
The two embedded AICs are of course:
(8)r1c2 = (8-6)r7c2 = r7c4 - (6=3)r8c6 - (3=4)r8c9 - (4=9)r1c9 => -9 r1c2
(8)r1c2 = (8-6)r7c2 = r7c4 - (6=3)r8c6 - (3=4)r8c9 - r1c9 = (4)r1c5 => -8 r1c5
So, can it be written like I did? One or two moves?
Question 2) This is another, less interesting, notation question about the the same puzzle. At the very beginning, I was contemplating taking an immediate placement as my first move before I chose to use the loop to weed out some candidates and simplify that step. Here's the situation:
- Code: Select all
+--------------------+------------------+---------------------+
| 1 789 579 | 5689 4589 2 | 3 4679 4789 |
|d2378 4 e279 | 689 1 c368 | 689 5 789 |
| 358 389 6 | 7 34589 3458 | 189 149 2 |
+--------------------+------------------+---------------------+
| 34567 13679 8 | 15 2 457 | 1569 13679 13579 |
| 24567 1267 12457 | 3 458 9 | 12568 1267 1578 |
| 2357 12379 12579 | 158 6 578 | 4 12379 135789 |
+--------------------+------------------+---------------------+
| 9 268 af24 | 2568 358 1 | 7 234 345 |
|a246 5 af(1)24 | 269 7 b36 | 129 8 1349 |
| 278 1278 3 | 4 589 58 | 1259 129 6 |
+--------------------+------------------+---------------------+
I came up with this to place 1r8c3:
AIC (ANS): (1=246)r7c3,r8c13 - (6=3)r8c6 - r2c6 = (3-2)r2c1 = r2c3 - (2=41)r78c3 => -24 r8c3
Is that how you would write it? My problem with it is that the conclusion is not immediately clear just by looking at the chain, but I guess it's business as usual with ALS stuff. Looking at the grid makes it obvious, of course, because we can see that there's only one candidate(1) in either ANS at the ends of the chain and it happens to be the same and located in r8c3 (could be seen as a discontinuous nice loop type 2 as well). The chain alone doesn't convey that piece of information, however.
(Added.) How about this: (1)r8c3 = (42)r78c3 - (2)r2c3 = (2-3)r2c1 = r2c6 - (3=6)r8c6 - (6=24)r8c8,r7c3 => -24 r8c3 ?
Anyway, after using the loop (step 1) first it was simplified into (step 2):
AIC (ANS): (4=2)r7c3 - r2c3 = (2-3)r2c1 = (3-6)r2c6 = r8c6 - (6=24)r7c3,r8c1 => -4 r8c3