The source is in this thread
end-in-n-digit-pattern-t46956.htmlgo_0with a path proposed by 'marek stefanik'
This thread is an attempt to see what can come out of a potential 5 digits end pattern.
The solution grid 324629003 has puzzles with a signature of a non TH pattern with a potential 4 digits end and a very high rating.
In the 2603 potential hardest database, we have 14 puzzles, all with the digits 1489 as potential end pattern. The highest highest rating is SKFR 11.8, a very high one.
- Code: Select all
....5.7....6.....37..2.35..2...3...63...7...5.4.9.....5...2.6.7..2....1......8...; 324629003;GXWf9YHK1HbGW0;23;105;0;0;1489
..3.5.7....6.....37..2..5..2...3...63...7...5.4.9.....5...2.6.7..2....1......8...; 324629003;KXW99YHK1HbGW0;23;105;0;0;1489
.2..5.7....6.....37....35..2...3...63...7...5.4.9.....5...2.6.7..2....1......8...; 324629003;IXWX9YHK1HbGW0;23;105;0;0;1489
.23.5.7....6.....37.....5..2...3...63...72..5.4.9.....5...2.6.7..2....1......8...; 324629003;MXW19YnK1HbGW0;24;105;0;0;1489
.23.5.7...5......37......6.2...3...63...72..5.4.9.....5...2.6.7..2....1......8...; 324629003;MHW1AYnK1HbGW0;24;105;0;0;1489
.23.5.7...56.....37........2...3...63...7...5.4.9.....5..32.6.7..2....1......8...; 324629003;MnW18YHK1PbGW0;24;105;0;0;1489
....5.7...5......37..2.3.6.2...3...63...7...5.4.9.....5...2.6.7..2....1......8...; 324629003;GHWfAYHK1HbGW0;23;106;0;0;1489
....5.7...56.....37..2.3...2...3...63...7...5.4.9.....5...2.6.7..2....1......8...; 324629003;GnWf8YHK1HbGW0;23;106;0;0;1489
..3.5.7...5......37..2...6.2...3...63...7...5.4.9.....5...2.6.7..2....1......8...; 324629003;KHW9AYHK1HbGW0;23;106;0;0;1489
..3.5.7...56.....37..2.....2...3...63...7...5.4.9.....5...2.6.7..2....1......8...; 324629003;KnW98YHK1HbGW0;23;106;0;0;1489
..3.5.7...56....237..2.....2...3...63...72..5.4.9.....5.....6.7..2....1......8...; 324629003;Knm98YnK11bGW0;24;106;0;0;1489
.2..5.7...5......37....3.6.2...3...63...7...5.4.9.....5...2.6.7..2....1......8...; 324629003;IHWXAYHK1HbGW0;23;106;0;0;1489
.23.5.7...56.....37........2...3...63...72..5.4.9.....5...2.6.7..2....1......8...; 324629003;MnW18YnK1HbGW0;24;111;0;0;1489
.2..5.7...56.....37....3...2...3...63...7...5.4.9.....5...2.6.7..2....1......8...; 324629003;InWX8YHK1HbGW0;23;118;0;0;1489
“marek stefanik” solved the 11.8 puzzle, so we know that here the hardest step is linked to an Exocet pattern. But the pattern had a five digits end potential, so I tried to see if this could be a source of high ratings.
Side question, but as for the 4 digits pattern, I tried to see how many solution grids could share this 5 digits patterns.
If we just look at the band 1, we still have 3 possible match, bands index 11,12,353.
But only one solution grid has a match with this 5 digits pattern;
My proof:
The solution grid must have one ED entry in the min lexical catalog. If we add the min lexical catalog properties, we come to this puzzle
- Code: Select all
123 456 789
45. .89 1.3
.98 .13 ..4
21. 834 9..
3.9 1.. 84.
84. 9.. .31
584 3.1 .9.
.3. .9. 418
9.1 .48 3..
And it has a unique solution
So again, it seems that with such patterns, the number of solution grids sharing the pattern is very small, unique for this one. The vicinity should deliver some close variants of the pattern.
