资 源 简 介
NoRush! is a brave attempt to fully solve the 6x6 Rush Hour game, using a complete (pre-made) pattern database.
Background
Solving Rush Hour games is a relatively easy task: given an initial board, the complete graph of reachable boards is usually quite small (in the lower 100,000s), making even a basic BFS search feasible and indeed quite fast (see Performance).
A slightly better approach is to use the [A* path finding algorithm](http://en.wikipedia.org/wiki/A*searchalgorithm), accompanied by some heuristic function (given a board, the heuristic returns an estimate of how far this board is from a solution). If the heuristic is both admissible and consistent, the algorithm is guaranteed to find an optimal solu
