A*_search Algorithm used to find the shortest path in an ASCII maze.
After compiling and executing the main.cpp file you will get the following output:
🚦 ⛰️ 0 0 0 0
🚗 ⛰️ 0 0 0 0
🚗 ⛰️ 0 0 0 0
🚗 ⛰️ 0 🚗 🚗 🚗
🚗 🚗 🚗 🚗 ⛰️ 🏁
Heuristic Function Test: passed
AddToOpen Function Test: passed
Compare Function Test: passed
Search Function Test: passed
CheckValidCell Function Test: passed
ExpandNeighbors Function Test: passed
Here 🚦 is the start and 🏁 is the end of the path. ⛰️ are the obstacles and 🚗 gives us the shortest path.