Rush hour game implemented in java, using A* algorithm to find the sequence of steps needed to solve the problem with the minimum number of movements.
This program includes 6 classes:
I. Main class where the desired test file is read.
II. Board class in which the parking is created.
III. Car class where the information about cars is defined.
IV. State class in which the information about the movements of cars is defined.
V. Astar class in which A* search algorithm is implemented.
VI. Heuristic class that performs calculations related to the shortest path.