The search of hardest puzzles used pattern scanning at the very beginning, mainly in the area 20_22 clues.
Later on, the main tool used has been the vicinity search, with a lot of variations.
The study of the so called "potential hardest" puzzles has shown that most of them had a limited number of "exotic properties", mainly
Exocet pattern
SK loop pattern
rank 0 logic pattern.
Anybody having tried to find new "hardest" using the vicinity search knows that one major difficulty is to find seeds.
I am for long thinking that a kind of reverse search, starting from a given pattern of given and trying to find a specific exotic property is one good way to create new seeds (and, why not, to find directly puzzles of the potential hardest family)
I tested with good preliminary results the pattern of the first puzzle in the potential hardest data base
11.1.....1.....1....1.1.....1...1.1...11..1......1...1..11..1......1...1.....1.1.;1;GP;champagne dry;
That pattern has been deeply searched, so I got no fresh high rating (11.0 and more), but I generated new seeds.
I open that thread to share experience on that process