code/__HELPERS/paths/pathfinding_helpers.dm

/proc/jps_path_to	This proc uses JPS to jump over large numbers of uninteresting tiles resulting in much quicker pathfinding solutions, but can "botch" some paths. Mind that diagonals cost the same as cardinal moves currently, so paths may look a bit strange, but should still be optimal. If no path was found, returns an empty list, which is important for bots like medibots who expect an empty list rather than nothing. It will yield until a path is returned, using magic.
/proc/astar_path_to	This proc uses A* to find the most optimal path between two turfs. Unlike JPS, it allows using a custom heuristic callback to change the weights of nodes. A* will always return the most optimal path and will not fail to pathfind in cases where JPS will (directional blockers).

/proc/jps_path_to

This proc uses JPS to jump over large numbers of uninteresting tiles resulting in much quicker pathfinding solutions, but can "botch" some paths. Mind that diagonals cost the same as cardinal moves currently, so paths may look a bit strange, but should still be optimal. If no path was found, returns an empty list, which is important for bots like medibots who expect an empty list rather than nothing. It will yield until a path is returned, using magic.

/proc/astar_path_to

This proc uses A* to find the most optimal path between two turfs. Unlike JPS, it allows using a custom heuristic callback to change the weights of nodes. A* will always return the most optimal path and will not fail to pathfind in cases where JPS will (directional blockers).