FCS 1.11.18 can now be downloaded from the site. I added a relatively
minor feature of being able to display the iteration number of the state
from which the current state was derived. But the big news is the addition
of the random DFS scan.
Random DFS is essentially the same as regular DFS, except that from every
state it reaches, it re-arranges the states derived from it in a random
order. One can supply the scan with a seed that determines its behaviour.
I noticed that for board No. 9 for example, The command "fc-solve
--method random-dfs -seed 7" solves it in 206 iterations. In normal DFS,
it takes over 2 million of them. Also, sometimes the solutions offered by
the scans are shorter than the normal-DFS ones, as is the case with PySol
board No. 980662.
What I would like to hack now is a batch program that runs several such
scans in parallel, each with a different seed for each board, and see how
fast it can solve the Microsoft 32,000.
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 Nov 27 2001 - 11:45:22 IST