Hosted Pages



Pathfinding Benchmarks



Grid-Based Path Planning Competition



AAAI 2017 Job Fair


AAAI 2017 Workshop on what's next for AI in games


Archived Pages


AAAI16 Student Activities

AAAI15 Student Activities

MAPF 2012 Workshop

AIIDE 2011

GIGA 2011

SoCS 2010

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 #1

Instance #2

Instance #3

Instance #4

Instance #5

Instance #6

Instance #7

Instance #8

Instance #9

Instance #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.

Downloads


© Nathan Sturtevant, All rights reserved.