Document Type

Article

Publication Date

2001

Abstract

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.

Comments

This article was published in Graph Theory Notes of New York, volume 40, 2001. It is included here with the journal's permission.

Share

COinS