Nice! Could you describe the search process you used? You mention A*, but did you use any lookup tables for end moves, etc?
The paper for solving the Rubik's Cube in the shortest number of possible moves used IDA* (Iterative Deepening A*) with extensive lookup tables. I think on average they get about 17 moves. There's also a freeware program out there (I have it but don't have the link handy) that can usually get it in about 20-25.
WeirdoFu - I would love to see a GA implementation for the Rubik's Cube. I've thought about it myself and just never got around to putting down some code. Maybe one of us will get around to it one day. 8^) My biggest concern goes to your statement "you'll get a solution." I'm not absolutely certain that to be the case as I think the search space is so massive that it'll have a hard time narrowing in on a solution. I could be totally wrong, and it will just take one of us breaking down and coding it up to find out.
-Kirk
Popular Topics
Advertisement