In 1997 Korf showed how to combine Pattern Databases with IDA* search
to find optimal solutions to random Rubik's cube instances. He
introduced 10 standard problems as benchmarks, which have appeared in
a variety of papers through the years. This page shows the optimal
solutions to the 10 standard instances. The instances can be
downloaded from the bottom of the page.
Instance #1Instance #2Instance #3Instance #4Instance #5Instance #6Instance #7Instance #8Instance #9Instance #10
Permission is granted to download and use these videos for non-commercial use. If you are using them,
please let me know: sturtevant at cs . du . edu.