Pathfinding Agents Game
A C and OpenGL game that lets players place obstacles and compare how search agents navigate a 20×20 grid.
- grid map
- 20×20
- player obstacles
- 10
- search agents
- 4+
Project note
This earlier team project turns pathfinding into a game rather than a passive visualization. Players choose an algorithm-controlled agent, place up to ten obstacles, and advance the simulation one round at a time while the score tracks the route taken.
The interface and rendering were built in C with OpenGL. The project compares depth-first search, breadth-first search, Greedy search, and A* inside the same 20×20 environment, making algorithm behavior visible through player-agent interaction.
It is distinct from the newer web Pathfinding Visualizer: this version emphasizes game rules, scoring, obstacle placement, and a custom desktop rendering loop.