10-02-2015, 08:03 PM
(10-02-2015, 07:28 PM)NiLSPACE Wrote: Here is a nice 2D visual representation of multiple pathfind algorithms: https://qiao.github.io/PathFinding.js/visual/ (After a while the IDA* started to freeze my browser though. It was using 900MB RAM)
If possible the Best-First-Search or Trace would be really fast. I'm not sure how they would work in a 3D environment though.
BFS does not guarantee finding the shortest path. A* is a bit slower but guarantees finding the shortest path. The code at Path.cpp already has a flag for switching to BFS. But it doesn't seem to be worth the tradeoff.
JPS sounds attractive. It's on the "potential todo" list @ first post.