tarek wrote:it would be interesting to see what the ratings of all puzzles would be after you update your program gsf !
tarek
do we have a comprehensive list of the hardest in one place?
I'll update in a few days
until then you can do it by the command line
for the puzzles that -qhardest says are not-solvable try:
- Code: Select all
-B -q-G -Z'FNP(FNBT2H2)V(6)||FNP(FNBTHW)V(7)||FNP(FNBTHWX)V(8)||FNP(FNBTHWXY)V(9)'
with ' quoting appropriate for your shell/command-line interface
the three puzzles should rate 99920 99921 99668 respectively with the above -Z expression
the first two puzzles solve with proposition constraint expression 8
- Code: Select all
FNP(FNBTHWX)V(8)
where V(8) is the label which shows up as V8 in the -f%Q output
this means that batched single candidate guessing requires X cycles (simple coloring)
the third puzzle solves with proposition constraint expression 6
this means that batched single candidate guessing requires naked/hidden pairs