PathFinding.js visualisation

[rich]

This is really great!

 

http://qiao.github.io/PathFinding.js/visual/

 

[Ezelia]

I looked at this project some months ago especially for the JPS variant of A* pathfinder.

but the performances was not here .

 

JPS is faster than all other implementations on that example, but I found other standard A* implementations (without JPS) witch are faster.

 

that being said, the given algorithm will cover most needs, in my case I had to make hundreds of pathfindings simultaneously on a map.

[rich]

Which one did you find that was faster?

[Ezelia]

I can't find the web site of the original author but here is the source code : http://searchco.de/codesearch/view/3158779

 

also there is something that made my JPS test slower, is the fact that JPS algorithm doesn't return all movement points, instead it only returns jump points plus source and target points, so I hade to calculate the middle point before making the move.

[Ezelia]

that being said, the visualisation tool is awesome to see the differences between all algorithms.

 

JPS is by far the fastest one, if implemented correctly

[martensms]

The pathfinder of Andrea was leaking pretty bad when I tested it, so I wrote my own A* based one from scratch. Slightly modified in the guessed path rating due to supporting different terrains (and speeds). But yeah, has much better performance. I couldn't use JPS as JPS has no information of the relations between points (and also speeds on the different terrain tiles that may influence the pathfinder algorithm dramatically).

 

https://github.com/martensms/tiberium-resurrection/blob/master/source/logic/Pathfinder.js