The following run of the range parallel solver:
# The John Galt Line
freecell-solver-range-parallel-solve 1 32000 1 \
--method random-dfs -seed 1 -to 0[0123456789] -step 500 -nst \
--method random-dfs -seed 2 -to 0[01][23456789] -step 500 -nst \
--method random-dfs -seed 3 -to 0[01][23467] -step 500 -nst \
--method a-star -step 500 -nst \
--method a-star -to 0123467 -step 500 -nst \
--method random-dfs -seed 4 -to 0[0123467] -step 500 -nst \
--method soft-dfs -step 500
Resulted in a run-time of 73 minutes[1] and totalled 26,765,593 iteration,
which is slightly better than the corrseponding run without using
Soft-Threads.
Note that omitting the "-step 500" option, which made it default to the
regular soft thread step of 50 iterations seems to make it considerably
worse: about 36 million iterations.
Regards,
Shlomi Fish
[1] - On a Pentium III 667 MHz.
--
----------------------------------------------------------------------
Shlomi Fish shlomif_at_vipe.technion.ac.il
Home Page: http://t2.technion.ac.il/~shlomif/
Home E-mail: shlomif_at_iglu.org.il
He who re-invents the wheel, understands much better how a wheel works.
Received on Wed Mar 20 2002 - 23:02:47 IST