This is an implementation of A* path searching algorithm to find path in the maze provided, for the car to reach the destination.
A* is a graph traversal and path search algorithm, which is often used in computer science due to its completeness, optimality, and optimal efficiency. The algorithm finds the optimal path. It is implemented in C++ language, taking advantage of its STL libraries.
For the program to compile, g++ compiler is required.
To run the program type following within the terminal:
- Clone
git clone https://github.com/pr2tik1/maze-solver.git
- Compile
g++ astar.cpp
- Run for the output to show
./a.out
The board can be changed and experimented by replacing '1' with '0' or vice versa (in 1.board).
Pratik Kumar
Credits - Udacity.