On Sunday 27 May 2007, tinx82 wrote:
> hmm.
>
> i've read about graph finding algorithm / pathfinding algorithm.
> Basically all the freecell solver programs use 1 varian of that
> algorithm (A*, BFS, etc), right?
>
> From what i could gather from a short read on A* algorithm, it can
> find the shortest distance/time needed to get from point A to B.
> What I can't understand is how to implement it to solve Freecell game.
>
> If point A is the start position of the card.
> And point B is the foundation stacks.
> I have to use the algorithm on that, and to use the freecell stacks as
> a "way" from point A to B?
>
> But then how it's supposed to move stacks of cards from one column to
> another if needed?
I discuss it in the FCS documentation:
http://fc-solve.berlios.de/docs/
Also see the Freecell Solver presentations:
http://www.shlomifish.org/lecture/Freecell-Solver/
>
> Btw, Shlomi, is it possible to chat about this? :D
> On msn,yahoo,gtalk etc :)
>
Sure:
http://www.shlomifish.org/me/contact-me/
MSN is preferable I think, and afterwards Jabber (also used by GChat). AIM and
ICQ are internationalisation-hell, and Yahoo keeps disconnecting, gives me a
lot of trouble and I don't have too many friends there.
> Anyway, back to reading more about A* algorithm and it's
> implementation ... :)
>
I haven't implemented A* in FCS yet. I found that DFS (= Depth-First-Search)
is enough. A* may yield better results, if done correctly, but Freecell
Solver still works pretty well, and I'm happy with it.
Regards,
Shlomi Fish
---------------------------------------------------------------------
Shlomi Fish shlomif_at_iglu.org.il
Homepage:
http://www.shlomifish.org/
If it's not in my E-mail it doesn't happen. And if my E-mail is saying
one thing, and everything else says something else - E-mail will conquer.
-- An Israeli Linuxer
Received on Sun May 27 2007 - 23:59:06 IDT