Graph Theory Notes of New York
The game of Rush Hour® includes a 6 × 6 grid and game pieces representing cars and trucks. The object of the puzzle is to move a special car out of a gridlocked “traffic jam.” In this note we apply Dijkstra’s algorithm and a breadth-first search to solve any Rush Hour configuration.
Mark Stamp, Brad Engel, McIntosh Ewell, and Victor Morrow. "Rush Hour® and Dijkstra’s Algorithm" Graph Theory Notes of New York (2001): 23-30.