A* Pathfinding Algorithm - 1.0
Simple implementation of the A* pathfinding algorithm using pygame.
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.
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.
Changes
Links
Releases
A* Pathfinding Algorithm 1.0 — 10 Jun, 2008
A* Pathfinding Algorithm 2.0 — 11 Jun, 2008
A* Pathfinding Algorithm 2.2 — 8 Jul, 2008