By using the algorithm described here:
http://groups.yahoo.com/group/hackers-il/message/2580
I was able to construct a static switching run of several scans that can
solve the MS 32000 in 5,184,532 iterations. (possibly less if you consider
all the boards that are reported as unsolvable and are no longer processed
by their scan). The generated command line is 2KB long.
This required collecting statistics for various scans, which takes a
really long time, because I need to run each primitive scan for all the
boards. Plus, the solver cannot run this command line yet, because I
still did not implement the prelude feature. But it's one of my main
priorities for now.
Regards,
Shlomi Fish
----------------------------------------------------------------------
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 Sat Jun 15 2002 - 20:00:19 IDT