Pathfinding

[arkeus]

Implement A* pathfinding in AxTilemap. Given a start and end tile, attempt to find the shortest path and return that as an AxPath which will be a series of either tile indices or points. Heuristic will be Manhattan distance.

Stretch goals: Include options for simplifying the path, whether to allow diagonal movement, etc.

In the future: Possibly support adding weights to tiles. Perhaps use raycasting to further simplify paths.

Please feel free to mention any ideas or requests you have for pathfinding. :)

[arkeus]

Pushing this to 0.9.3. It is partially implemented, but is not fully functional yet. Feel free to play around with it until its finished. :)

[freddymx]

sorry but.. how I can to download the 0.9.3???

[arkeus]

But pushing to 0.9.3, I meant that originally this was going to be in 0.9.2 (which should be released very soon), but I'm going to push it back to not be in until 0.9.3.

[freddymx]

I am following a tutorial that is the subject of pathfinding and looks very interesting http://alanchavez.com/pathfinding-con-obstaculos-en-as3-a-con-heuristica-euclidiana-manhattan-diagonal