Implemented procedural AI algorithms, like BFS, A*, and Dijkstra, from scratch to find the shortest path between two points on a plane that has convex polygonal obstacles.
-
Updated
May 2, 2026 - C++
Implemented procedural AI algorithms, like BFS, A*, and Dijkstra, from scratch to find the shortest path between two points on a plane that has convex polygonal obstacles.
Build adaptive game villains that learn player behavior and evolve strategies across sessions
Add a description, image, and links to the procedural-ai topic page so that developers can more easily learn about it.
To associate your repository with the procedural-ai topic, visit your repo's landing page and select "manage topics."