I made one ages ago : Pathfinding algorith
Now init i explained basically what waypoints are , customizing these waypoints according to your map you can use it wherever u want !
its dynamic and if u use byob it can find u paths in matter of milli-seconds!
(its also very very similar to the common game pathfinding algorithms used , the only different is they use a 4 arrays for the Z axix and special actions like Jumps , dive , duck etc to be performed in order to follow a given link )
feel free to use and if u find any trouble using it just let me known i am always happy to help 8-)
Last edited by fanofcena (2011-04-06 06:13:20)
Offline
wcfs96 wrote:
You might also want to look at A* path finding. I can't post links cause I'm a "New Scratcher" *sigh* but you can find some articles on Google if you search.
What i sent is *sigh* nearly A* though ripped off as scratch is really slow doing exhaustive maths
Offline
@wcfs96, you should be promoted to Scratcher early. You seem to be really good at it, and have 24 posts.
Offline
wcfs96 wrote:
You might also want to look at A* path finding. I can't post links cause I'm a "New Scratcher" *sigh* but you can find some articles on Google if you search.
Thats what I was hoping to model my algorithm after, but I'm not sure how fast that will be.
Offline
Here is the best A* tutorial I've found: http://www.policyalmanac.org/games/aStarTutorial.htm
Offline
fullmoon wrote:
Coolstuff has a project that finds a path around obstacles on a grid.
Thanks for that neat little reference! Yes, I did make that project a while back, and personally, I think it performs admirably.
Offline
BoltBait wrote:
Here is the best A* tutorial I've found: http://www.policyalmanac.org/games/aStarTutorial.htm
Thanks, looks really good
(need to get done with some pesky home work before I read it tho
)
Offline