This is my latest effort extensively revised after a helpful PM exchange with Blue:
When the number of cover houses needed for an (abcd) Almost JExocet are (a) =2, (b) =2, (c) >2, (d) =1
The alternatives are
1) JE = True: (d) will be false in the base and target cells.
2) JE = False: (c) will be true in the base cells and three 'S' cells.
So it's not such a win-win as I thought. However this does provide these derived inferences:
1) Weak link (d-ab#1) base cells ... which forces (c)base cells
2) Weak link (d)base cells – (all other digits)target cells ... if (d) is true in the base cells it must occupy both targets.
3) Weak link (x)base cells – (x)CellsSeeingBothTargets for x = (a) or (b) ... the digit must be true in at least one target
4)Weak link (ab)base cells – (d)Cell_inSameMini-Line ... explained below.
5) Strong link (c)base cells = (ab)JE ... when (c) is false then (d) must be false too and a (ab)JE will be true
6) Strong link (c)'S'Cell Swordfish = (abc)JE ... either three (c) 'S' cells will be true (making a Swordfish) or a (abc)JE will be
Inference 4): when the (ab)JE is true (d) must be true in two cross-line cells in the JE band in sight of the base cells. It therefore can't be true in the same mini-line as the base cells as then no second cell would be available.
Note that when (c) is true with either (a) or (b) one of the targets won't be constrained and will be free to contain any digit.
The list had to be revised because I suffered from a bout of brain rot and managed to mix up the different cases.
- Code: Select all
*--------------------------*--------------------------*--------------------------*
| <5> 13489 123489 | 1236 12346 t 136 | 2368 <7> 1246 |
| <6> <7> 12348 | 1235 <9> 135 | 2358 12345 t 1245 |
| 234 b 134 b 1234 | 123567 123467 <8> | 2356 12345 <9> |
*--------------------------*--------------------------*--------------------------*
| 2349 3459 <7> | 1359 <8> 1359 | 259 <6> 125 |
| <1> 3569 359 | 35679 367 <2> | <4> <8> 57 | ..3.
| 29 5689 2589 | <4> 167 15679 | 2579 125 <3> | 12..
*--------------------------*--------------------------*--------------------------*
| 379 1359 1359 | 123679 12367 <4> | 23567 235 <8> | 123.
| 3479 <2> 3459 | 8 367 3679 | <1> 345 4567 | ..34
| <8> 134 <6> | 1237 <5> 137 | 237 <9> 247 |
*--------------------------*--------------------------*--------------------------*
CLb CL1 Cl2
Almost JE (1234)r3c12, r1c5,r2c8 (cover houses (1)=2, (2)=2, (3)=3, (4)=1)
(3=12)r3c12 -[JE]- (12#1=35)r2c46 => r2c3,r3c45 <> 3 (r2c46 is in sight of both target cells)
(3=12)r3c12 -[JE]- (4)r1c5 = (47-6)r3c45 = (6)r3c7 => r3c7 <> 3 (r1c5 is a target cell)
These are the only unbranched AIC inferences I've found, but using forcing chains or net based methods much more can be achieved.
There is also a problem that concerns me but probably not many others. Because the JE is unproven if a derived inference from it is used further on in the chain this involves using memory and the chain ceases to be bidirectional. I can accept that approach only if the JE has been proved in a previous step because then it can be considered an established fact similar to a previous candidate elimination.
[Edits] the original posting was withdrawn and a revised version posted on 31st Jan 2015