__v2 A* (A star) and Dijkstra game pathfinding for tile games
|__v2_A__(A543672102002.zip||9/3/2020 3:45:00 PM||28,949|
v2 ! Improved speed of A* and Dijkstra pathfinding !!! I love computer tile games (Heroes of Might & Magic, etc...) and have always brought interest to such game programming technics. The code example below presents fast bitblt through an array and onto a picturebox. This method is faster than usual loop through array. This method is usefull only for games that use LoadRessource, LoadPicture functions (or similar home-made ressource loading) since it loads each picture once. The other example is plain pathfinding. It figures out fastest way to go from one point to another according to terrain difficulties. It implements two famous methods : Dijkstra & A* (a star). Please send me any interesting paths so I can add them to the zip. If you know how to improve this pathfinding, please email me, I'll be very happy to recieve usefull feedback. The A* can still be deeply improved, if you wish more details, read the comments inside the code. Maybe making the thread priority temporarily to a higher level or even multi-threading could improve the speed.
Vote for me if you like this code !
Original Author: Julien Lecomte
Comments on this post
No comments have been added for this post.
You must be logged in to make a comment.