![]() If your want to know more about A* (star) pathfinding search algorithm, visit the Wikipedia article. Please feel free to adapt and use for your own purposes. This example uses nothing more complex than arrays. May of the pathfinding examples I saw were for object oriented languages that allow for more complex data structures. ![]() It works but there is still room for improvement. ![]() This is the source code for a Dijkstra A* pathfinding algorithm I wrote in PureBasic.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |