Dynamic A* Pathfinding 3.2

[Heathen]

Update coming

[Heathen]

...

[SCRJ]

Nice example, thanks!
But, have a look on the picture :

http://img227.imageshack.us/img227/267/imgtv1.jpg

[Heathen]

Thanks for pointing that out

Check the first post for an update

[SCRJ]

Thanks...but now, the code crashes with the same error on line 88:

Code: Select all

      t = GetTickCount_() 
      FreeMemory(*path) ;<<Here.
      *path = get_path(startx,starty,tox,toy,#width,#height,allowdiag,blockdiag) 

[Heathen]

Thanks...but now, the code crashes with the same error on line 88:

Code: Select all

      t = GetTickCount_() 
      FreeMemory(*path) ;<<Here.
      *path = get_path(startx,starty,tox,toy,#width,#height,allowdiag,blockdiag) 

I updated the example in the second post

[SCRJ]

Now it works correctly!
Good job, man

[Heathen]

I optimized much of the code, now it is much much faster. The code is updated in the first post and the example is also updated.

[JCV]

Hi Heathen I suggest the ff:
-use binary heap - really fast even on very large maps.
-use arrays instead of linklist

Your code looks clean and easy to understand.

[Heathen]

Hi Heathen I suggest the ff:
-use binary heap - really fast even on very large maps.
-use arrays instead of linklist

Your code looks clean and easy to understand.

Thanks for the suggestions I will consider them for the next version.

[Heathen]

Updated to 1.0, added binary heaps and lots of optimizations. I also added procedures for loading and saving of paths, aside from that I added a procedure called nearest_node() which can be used for finding the nearest node in a precomputed path relative to an x and y position. This way, if the object strays off of the path for whatever reason, it can pathfind to the nearest node of the precomputed path.

[dracflamloc]

Wow thats good stuff. THanks!

[Heathen]

...

[Heathen]

...

[Chrono Syndrome]

Great job !