Pathfinding

Hi all

I have used the Aaron Koolen's code for pathfinding and it works OK, but I have a grid of 100x100 and the method is very slow.

It finds the path quickly, but in the end, the algorithm needs to reset all the grid before begin another pathfinding.

Any idea on how to solve this or another code to do pathfinding in blitzMax without this limitation?

Thanks in advance and sorry for my english

-Banky

You could use the fast Marching method, I sat in a lecture on a year or so ago, and coded it in B3D, it was nice and fast and real time, I always meant to get roud to using it in a car game for the AI but never got time.

Try google. FMM or Fast Marchign Method.

You could try using something like this...
Two-tiered A*