AI Pathfinding

For the first assignment in the second year of university the task was set to create a program that would calculate a path between two points using a pathfinding algorithm. The brief of the assignment also required that the resulting path must also be displayed on some sort of graphical interface. For this assignment I created an interface using a graphics library called SDL. This interface featured a grid that could be interacted with. Users are able to add a start and end point to the grid as well as designate any grid space as uninhabitable, essentially creating walls. The next step was to implement a pathfinding algorithm. The final program featured five pathfinding algorithms in total: breadth first search, depth first search, best first search, Dijkstra’s algorithm and A*.