ronk wrote:Why is this not an Aligned Pair Exclusion ("APE") for ER=6.2? Does Sudoku Explainer restrict the cells of an APE to a box and a line (row or column)? If "yes", is this restriction commonly applied by others?
- Code: Select all
..4..2..3....4..8.8..3..1....3.7...6.5.9...7.6.....5....9..7..8.1..9....2..4..6..
At the point of the "Cell Forcing Chain (ER=8.3)" move:
*159 *69 4 | 15678 1568 2 | 79 *56 3
135-9 2369 125 | 167 4 156 | 279 8 259
8 267 257 | 3 56 9 | 1 2456 245
-------------------+-------------------+------------------
*19 289 3 | 158 7 1458 | 2489 24 6
4 5 28 | 9 2368 36 | 38 7 1
6 2789 1278 | 128 1238 134 | 5 234 29
-------------------+-------------------+------------------
35 4 9 | 256 2356 7 | 23 1 8
7 1 6 | 28 9 38 | 234 2345 245
2 38 58 | 4 135 135 | 6 9 7
r2c1 -9- r4c1 -1- r1c1( -9- r2c1) -5- r1c8 -6- r1c2 -9- r2c1 ==> r2c1<>9
Ron,
Upon reflection, I would call it an ALS-XZ chain with als 1 r1c28.<569> -5- als 2 r14c1.<159> => r2c1 <> 9. I think I read somewhere that all APEs could be described by ALS chains??? But, almost all APE descriptions imply that the eliminations occur within one of the APE core cells, so I'm not sure how this particular set of 4 cells would qualify as an APE.
I'm surprised that there were objections to defining this as an ATE with the core triplet cells r1c1 r1c2 and r2c1. The exclusion cells r1c8 and r4c1 by themselves reduce the candidate combinations of the core cells to produce the r2c1 <> 9 elimination. SE incorrectly enforces bi-values to see all three core cells for an Aligned Triple, if I'm reading the code correctly at lines 115-123 of AlignedExclusion.java. It is sufficient to be a peer to any 2 of the three core cells of an Aligned Triple in order for a bi-value exclusion cell to eliminate combinations. Only a tri-value exclusion cell needs to see all 3 core cells in ATE. I've experimented with Stuart's Type 2 eliminations, and two-cell triple value ALSs do indeed act as 3 pseudo-cell bi-values. If the ALS candidates are ABC, then the 3 pseudo-cells produced are AB, AC, and BC exactly as Stuart described them. All the cells describing the ALS must be peers to both core cells of an APE, or any 2 cells of an Aligned Triple. By extension, a 3 cell 4 candidate ALS with values ABCD can act as 4 pseudo-cell tri-values: ABC, ABD, ACD, and BCD provided all 3 ALS cells are peers of all 3 core cells of the Aligned Triple. As it turns out, for APE the 2 core cells can be positioned anywhere in the grid as there are always a minimum of 2 cells that qualify as exclusion cell positions, although such a setup probably overlaps UR tremendously. I currently limit my ATE processing to enforce sharing a chute between any 2 core cells, but this was done mostly to speed-up the processing since the algorithm is painfully slow, but it seems likely that any 3 cells could potentially define the core cells.
If anyone has algorithms that they are willing to share for APE/ATE processing, I would be grateful to exchange ideas/code/concepts.
Cheers,
Paul
P.S. I'd rather code a really fast subset counting algorithm if anyone has such a beast. I've got one, but it's painfully slow once the permitted cell count goes over 8 cells.