https://github.com/adamslevy/rush_hour_solver
A rush hour board representation and a breadth first search solver.
https://github.com/adamslevy/rush_hour_solver
Last synced: about 2 months ago
JSON representation
A rush hour board representation and a breadth first search solver.
- Host: GitHub
- URL: https://github.com/adamslevy/rush_hour_solver
- Owner: AdamSLevy
- Created: 2016-01-10T03:46:10.000Z (over 9 years ago)
- Default Branch: master
- Last Pushed: 2016-01-10T03:46:38.000Z (over 9 years ago)
- Last Synced: 2025-03-17T22:13:21.582Z (2 months ago)
- Language: C++
- Homepage:
- Size: 3.91 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Rush Hour Solver
Board.cpp and Board.h define a Rush Hour board class.
BoardQ.cpp and BoardQ.h define a Queue of Rush Hour boards. This is used by the bread first search.
bfs.cpp defines a breadth first search which exhausts all possibilities and prints out the shortest solution.
## To run
Run make. Run rush_hour_solver.
The program will solve the hardest known sudoku board and print out the steps. It takes about a minute to solve. The full solution is printed before the program exits.