I don't get the shortest path about javascript-astar

[gyril]

Hm after toying with it, the number of nodes is constant, so it's most likely because of the weighting of the diagonal moves (making this issue a duplicate of #10)

[bgrins]

Are you using the diagonal heuristic? I think this might actually be due to missing documentation / not assuming diagonal heuristic with a diagonal grid. Can you try adding { heuristic: astar.heuristics.diagonal } as a final parameter to the search function?

[gyril]

I've edited your library now so I think I broke things, but yeah, from what I understand, applying the diagonal heuristic would have worked; however, it is not documented and I expected it to be applied automatically when I chose a diagonal pathing.

[bgrins]

however, it is not documented and I expected it to be applied automatically when I chose a diagonal pathing.

Sorry about that, I've added a note to the README about the heuristic.