I have a problem that I have to solve that's very similar (I assume) to
solving a rubik's cube.
It's a finite state machine with a large number of states, a few number
of possible moves, and one solved state. It has considerably fewer than
a rubik's cube though, only 3^16.
Initally I used a depth first search, and I don't know how long God's
algorithm for this will be, but from empirical tests, it's more than I
can solve efficiently.
I've been looking all over the internet to try to find a clear
explaination of the algorithm used to solve the cube. All I can find
is that it is a heuristic algorithm, nothing more.
If anyone knows how to implement this algorithm or can direct me to a
page that can tell me, that would be great.
-Ben.
Yahoo! Groups Links
<*> To visit your group on the web, go to:
http://groups.yahoo.com/group/speedsolvingrubikscube/
<*> To unsubscribe from this group, send an email to:
[EMAIL PROTECTED]
<*> Your use of Yahoo! Groups is subject to:
http://docs.yahoo.com/info/terms/
