astar search algorithm in JavaScript
npm install javascript-astarSee a demo at http://www.briangrinstead.com/files/astar/
If you want just the A* search code (not the demo visualization), use code like this http://gist.github.com/581352
``js``
A few notes about weight values:
1. A weight of 0 denotes a wall.
2. A weight cannot be negative.
3. A weight cannot be between 0 and 1 (exclusive).
4. A weight can contain decimal values (greater than 1).
The original version of the algorithm used a list, and was a bit clearer but much slower. It was based off the original blog post. The code is available at: https://github.com/bgrins/javascript-astar/tree/0.0.1/original-implementation.
The newest version of the algorithm using a Binary Heap. It is quite faster than the original.
http://www.briangrinstead.com/blog/astar-search-algorithm-in-javascript-updated
Binary Heap taken from http://eloquentjavascript.net/appendix2.html (license: http://creativecommons.org/licenses/by/3.0/)
If you don't have grunt installed, follow the grunt getting started guide first.
Pull down the project, then run:
npm install
grunt