A* Pathfinding Algorithm
A* Pathfinding Algorithm - 2.2
Canio Massimo Tristano (keebus)
This is a A* pathfinding algorithm demo working with pygame.
Just run the run.py file.
Red cell means it's in the CLOSED list, green in the OPEN list (cells still to check). The numbers in cells are g (the cost), h ( the heuristic) and f ( the total score, f = g + h).
Thanks and enjoy.
Possibility to save/load the map and other improvements.
Pygame.org account Comments
If you wish to leave a comment with your pygame.org account, please sign in first.