Greetings all.

Just wanted to let everyone know that I have finally released my Pathfinding source code. I said I'd do so months ago, but this is a complete re-write, and is 2-3 times faster (about 0.3ms per step on the highest accuracy level on my 1.3ghz duron).

It is available in the lab section of my new site:

From the Read Me:
The Pathfinder class was developed to be a flexible, happy medium for pathfinding in Flash. To that end, it is much more accurate than simple "move towards" algorithms, and vastly faster than A* (~1ms per step on highest level on 500mhz system). Also, it's speed scales in a linear fashion with the length of the path, rather than exponentially as with A*, and speed is unaffected by map size.

It uses a ranked movement algorithm (move towards, move laterally, move away), paired with backtrack avoidance and looping detection. It also utilizes up to 4 different pathfinding approaches (forwards or reverse, favouring horizontal or vertical movement).

It offers a fair amount of flexibility, with the ability to set the maximum path length, and to scale the number of different approaches the system will attempt. You can also change any parameter at any time, and re-run the pathfinding routine (which allows for characters changing direction at any time), etc.

If you have any feedback, questions, or ideas, you can contact me through my site at .

The Pathfinder class is free for use in non-commercial projects, all that I ask is that you fire me an email and let me know what you're using for, and what you think of it (hearing back from you makes developing and releasing code for free worthwhile). I would also really appreciate credit and/or a link back to my site at , if possible.

If you would like to use it in commercial contracts, please contact me for license information. Often, it will be as simple and inexpensive as giving due credit.

You may NOT sell the Pathfinding path as it is, in a modified format, or as part of a derivative work without prior written consent.

The Pathfinding class is copyright 2002, Grant Skinner, all rights reserved.