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?
Btw, Shlomi, is it possible to chat about this? :D
On msn,yahoo,gtalk etc :)
Anyway, back to reading more about A* algorithm and it's
implementation ... :)
Cheers
Budi.
Received on Sun May 27 2007 - 01:49:44 IDT