Skip to main content

A* Pathfinding Algorithm - 2.2

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.

Changes

Possibility to save/load the map and other improvements.
ai 35 pathfinding 16 astar 9 path 5

Links

Home Page
http://www.keebus.net/?page_id=52
Source
http://www.keebus.net/?page_id=52

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

Pygame.org account Comments

  • Şahin Mersin 2011-05-25 21:40:52

    very good

  • Real name 2017-08-30 13:17:42.143559

    the page isn't working

  • Fabian 2020-10-16 14:31:27.307610

    dead

  • Fabian 2020-10-16 14:31:49.087304

    dead