Hi
Hajime,
I started by finding all valid minimal puzzles matching the given pattern within the 35 solution grids that have 27+ automorphisms. Only this puzzle appeared and I used it as the only seed for vicinity search.
- Code: Select all
......1....1.....2.2.3...4.5...1.6...7.8.9.2...4.6...9.8...2.7.1.....5....3...... ED=1.5/1.2/1.2
Then I followed procedure described
here.
I decided to ignore non-minimal puzzles. Utilized 4 CPU cores for less than a day. I did 45 runs from which last 15 gave no improvements. The hardest diamponds appeared somewhere in 10 - 15 run. One run produces one or more puzzle generations and I didn't count them, but likely 100-200 generations were produced.
As usual, {-2,+2} with EP filter was most productive. Ocassionly I tried -+3 or even -+4 on the top few ED or ER.
I gradually decreased EP margin. At the end the filter was ER=any, EP >= 4.0, ED=any, and -+2 produced only garbage.
For a typical for the game pattern, rating millions of 10+/x/y puzzles significantly slows down the process. This wasn't the case for this pattern.