Hi all,
On Wed, 24 Oct 2012 14:34:21 +0200
Shlomi Fish <shlomif_at_shlomifish.org> wrote:
> On Wed, 24 Oct 2012 00:48:00 +0200
> Shlomi Fish <shlomif_at_shlomifish.org> wrote:
>
> > Hi all,
> >
> > a few days ago, when working on the Freecell Solver trunk, I decided
> > to work on the implementation of alternative results orderings for the
> > random-dfs scan within the ordered next-states groups, for example by
> > using the Best-First-State state rater. As a precursor, I decided to
> > implement a parameter for these state ordering based on the
> > depth of moves' irreversibility that was investigated previously in
> > the context of the depth_dbm_fc_solver.
> >
> > So I implemented it - it was not too hard and timed the scan
> > "--flare-name 33 --method a-star -to 0123467589 -asw 0,0,0,0,0,100 -sp
> > r:tf -opt", which is a best-first-search scan that is based solely on
> > it. It didn't yield a good speed-wise result, but instead it featured
> > predominantly on the hybrid speed/short-solutions scan.
> >
Before I write a more comprehensive report, I should note that since half of
the original sixth weight's measurement was in fact the first weight, I've now
made the sixth weight only the other part (of the number of cards that are not
above their parents). One can get the original behaviour by splitting the
first and the sixth weight evenly:
-asw 50,0,0,0,0,50
Cheers!
Shlomi Fish
--
-----------------------------------------------------------------
Shlomi Fish http://www.shlomifish.org/
Interview with Ben Collins-Sussman - http://shlom.in/sussman
In the Technion, there are many ways to get from one place to the other, but
they are all the same length.
Please reply to list if it's a mailing list post - http://shlom.in/reply .
Received on Mon Oct 29 2012 - 19:12:14 IST