This was a quick project developed over two 1-hour lab sessions on the AI for games course (MScCGE at Goldsmiths, University of London), showcasing a very simple pathfinding system over a graph of waypoints.
The pathfinding is based on the A* search algorithm, and the edges in the graph can be either explicitly defined by a designer, or dynamically generated at start using raycasts.
Although very simple, the project served as a practice of the A* algorithm’s implementation and as a quick introduction to waypoint-based pathfinding systems.