JoanStinson/Pathfinding
C++ SDL AI Pathfinding: BFS, Dijkstra, GBFS and A* algorithms.
This project helps game developers visualize and compare how different AI algorithms find the shortest or most efficient routes through a map. You input a game map with obstacles and start/end points, and it outputs a clear animated path showing the route the AI would take. This is ideal for a game AI designer or developer building navigation systems for characters or objects in a game.
No commits in the last 6 months.
Use this if you are a game developer needing to implement or understand core pathfinding algorithms for character movement in your game.
Not ideal if you need a pathfinding solution for non-game applications like logistics, network routing, or robotics, as its focus is on game AI principles.
Stars
11
Forks
2
Language
C++
License
MIT
Last pushed
Sep 16, 2022
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/JoanStinson/Pathfinding"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
forestagostinelli/deepxube
Learn a domain-specific heuristic function in a domain-independent fashion to solve pathfinding problems.
misaghsoltani/DeepCubeAI
Learning Discrete World Models for Heuristic Search
algoprog/Laby
Maze generator, editor & solver in Java
FK04/AI_Lab
AI lab implementations covering informed and uninformed search algorithms with classic...
VedantKhairnar/The-Maze-Runner
AI : Use of Greedy Best First Search Traversal to find route from Source to Destination in a Random Maze