A* Pathfinding

DigiPen Institute of Technology 

CS380 

November 2020 

I wrote A* as one of my CS380 projects during my senior year at DigiPen. This project required me to implement A* and several different heuristics for how A* was calculated. I implemented Chebyshev, Euclidean, Manhattan, and Octile methods of calculating the distance, thus changing how A* found an optimal path. After I completed A*, it needed to pass over 3000 different tests where the maze and starting position was different each time. Overall, I really enjoyed doing this project and learning how to do one of the most popular path finding algorithms.