Hi JC,
On Fri, 29 May 2015 02:54:34 +0200
"Jean-Charles Meyrignac jcmeyrignac_at_gmail.com [fc-solve-discuss]"
<fc-solve-discuss_at_yahoogroups.com> wrote:
> Hi there,
>
>
> I was able to write my own FreeCell solver.
> It's pretty fast and is able to find good solutions in a very short amount
> of time.
> My approach uses Beam Search and Zobrist hashing, in around 600 lines of C.
> The larger the Beam Search, the better the solutions.
Nice! Can you share your code? See
https://en.wikipedia.org/wiki/Forge_%28software%29 - right now it seems that
https://en.wikipedia.org/wiki/GitHub is the most popular. Also see:
http://choosealicense.com/
>
>
> For example, for FreeCell #1, the program finds a solution in 35 moves with
> a BS of 10000 (in 2 seconds), and in 32 moves with a BS of 1000000 (240
> seconds).
Sounds nice.
> Yuri's solution takes 40 moves.
>
>
> In 2013, Danny Jones and Yuri Bortnik seem to have tried to optimally solve
> the first 1000 games.
>
>
> Have these results been published somewhere ?
>
I don't know about that.
Regards,
Shlomi Fish
--
-----------------------------------------------------------------
Shlomi Fish http://www.shlomifish.org/
Understand what Open Source is - http://shlom.in/oss-fs
Buffy: OK, Xandoosh, can you perform a search to find where such a duplicator
is present?
Xander: Sure! Hey, Wil, can you use a spell for that?
— http://www.shlomifish.org/humour/Buffy/A-Few-Good-Slayers/
Please reply to list if it's a mailing list post - http://shlom.in/reply .
Received on Fri May 29 2015 - 02:08:45 IDT