For larger Rubik's cubes, a naive A* won't cut it, as it still has exponential growth. Iterative deepening A* built atop a pattern database has worked well thou

For larger Rubik's cubes, a naive A* won't cut it, as it still has exponential growth. Iterative deepening A* built atop a pattern database has worked well though. This paper from 1997 also discusses heuristics - https://www.cs.princeton.edu/courses/archive/fall06/cos402/papers/korfrubik.pdf https://www.cs.princeton.edu/courses/archive/fall06/cos402/p... And since I'm pulling from Udacity's AI course anyway, might as well provide this; the 3x3 has been fully solved. Depending on the metric - http://www.cube20.org/ http://www.cube20.org/ or http://www.cube20.org/qtm http://www.cube20.org/qtm