eleven wrote:
Yes, its all but easy to show, how the eliminations can be made. But e.g. in "champagne dry" there is a 4 unit elimination (if my propram is right), which i guess must be easier than ER's 11.8 step. If possible, i would like to classify puzzles with e.g. "can be solved with 5 units moves". I dont have a chance to check all possible 5 units moves, but i see good chances to find solutions with 6 unit moves in reasonable time for (almost ?) all puzzles. This is somewhat surprising for me. Before i thought, that hardest puzzles would need 8+ units for the hardest move.
some comments:
1) champagne dry has an EXOCET pattern. This is usually a four floors structure, sometimes a three floors ("fata morgana", "trompe l'oeil"...)
2) The first puzzle is identified in my list as having a "rank 0 logic". In fact, my solver detected a "row based" rank 0 logic
sets 2789R2 2789R4 2789R5 2789R7
linksets 89C2 79C6 79C8 28C9 D2 E2 C4 E4 A5 G5 A7 C7
ronk seems to have another one. My solver does not look for that pattern
3) the second puzzle has a pure rank 0 logic but using 5 rows
here is XSUDO output for that logic
- Code: Select all
+---------------------------+--------------------------+---------------------------+
| 16(9) 16(289) 3 | 4 (258) 6(25) | 7 16(8) 16(589) |
| 1467 5 678 | 378 38 9 | 148 2 1346-8 |
| 467(9) 467(289) -7(289) | -37(258) 1 367(25) | -4(589) 346(8) 346(589) |
+---------------------------+--------------------------+---------------------------+
| 2 3 679 | 789 48 147 | 1489 5 1467-89 |
| 47(59) 47(9) 1 | -7(2589) 6 47(25) | 3 47(8) 47(289) |
| 8 467-9 5679 | 23579 2345 1347-25 | 1249 1467 1467-29 |
+---------------------------+--------------------------+---------------------------+
| 137(5) 17(28) 4 | 6 9 3(25) | -1(258) 137(8) 137(258) |
| 1367-5 167-2 2567 | 235 2345 8 | 1245 9 1347-25 |
| 3(59) (289) (2589) | 1 7 34(25) | 6 34(8) 34(258) |
+---------------------------+--------------------------+---------------------------+
- Code: Select all
72 Candidates,
19 Truths = {2R13579 5R13579 8R13579 9R1359}
19 Links = {59c1 289c2 25c6 8c8 2589c9 1n5 3n347 5n4 7n7 9n3}
18 Eliminations --> r3c34<>7, r6c69<>2, r6c29<>9, r8c29<>2, r8c19<>5, r24c9<>8, r3c4<>3,
r3c7<>4, r4c9<>9, r5c4<>7, r6c6<>5, r7c7<>1,
EDIT : something is wrong in that table; Truths should appear as 2589 in rows 1;3;5;7;9
we have 19 truths
Links are ok
My solver does not look for more than 4 rows to build a SLG.
Here we have 5 rows, but the process is the same;
The floors used here are complementary to eleven's proposal.
Very often, when a group of floors is active, the complementary set is active also.
The 4 floors is easier to build and more efficient.
champagne
).
