Well, I planned to run the same run as before only with the soft-dfs scan
added. However, due to the fact that I run it on a Win2K system and
because .bat files do not treat single quotes as a special character I got
something different than I wanted. However, it seems to give excellent
results. The scan is:
#!/bin/sh
./mptest 1 32000 20 \
--method random-dfs -seed 1 -to 0[0123456789] --next-instance \
--method random-dfs -seed 2 -to 0[01][23456789] --next-instance \
--method random-dfs -seed 3 -to 0[01][23467] --next-instance \
--method a-star --next-instance \
--method a-star -to 0123467 --next-instance \
--method random-dfs -seed 4 -to 0[0123467] --next-instance \
--method soft-dfs
I discovered that the Microsoft 32,000 boards were solved after 27,735,701
iterations, which is about 1,900,000 iterations. And there were no
intractable boards.
This time I ran it on a Pentium 4 1.7 GHz. It took it 30 Minutes, which
makes it 1,066 boards per minutes or 17 per second. But naturally it was a
much faster computer. Normalizing it to the P3 we get about 87 minutes.
As a side note, I should add that I wish to benchmark these results
against FC-Pro's solver by Don Woods, but I don't know what options to
use. When I try to run it it gets stuck in board 1,433 for a very long
time.
Regards,
Shlomi Fish
--
----------------------------------------------------------------------
Shlomi Fish shlomif_at_vipe.technion.ac.il
Home Page:
http://t2.technion.ac.il/~shlomif/
Home E-mail: shlomif_at_techie.com
If:
1. A is A
2. A is not not-A
does it imply that
1. B is B
2. B is not not-B
Received on Tue Dec 04 2001 - 01:58:48 IST