Fast and flexible AStar (A*) pathfinding in Haxe/As3

This project still exists! I had just started optimizing it and then had actual real world work to attend to.
The only actual optimization done so far was making all of the functions in the priority queue  inlined which added a pretty significant boost to speed actually:

Old pathfinder Benchmark: 937
Setting all PQ methods to inlined: 637

Other then that the test app was enhanced a bit to make bench marking easier:

Changes

  • Benchmark added. Takes the average pathfinder time of 100 runs
  • Removed random walls function and added a stress test function
  • Pathfinder can now (as intended in original version) use maps of differing width and height (must be power of 2)

 

Next release will include the source. I probably will not be able to do much more optimization but anybody else may try :)

2 Comments

  1. Amit Patel says:

    Nice! Is the code available anywhere?

  2. DakaSha says:

    Not yet as it is currently very messy and unoptimized. I promise to make it available as an open source project once I have it all tidy :)

Leave a Reply