Enum Flow.PathfindingMode

Constants for pathfinding modes.

To be used in mode setting.

Members

BFS Breadth-first search or BFS (original Core algorithm).
DIJKSTRA Dijkstra's algorithm with distance weights.
ASTAR A* algorithm with distance weights and heuristic (default).


Members

BFS
Breadth-first search or BFS (original Core algorithm). Fast but treats all boxes equally regardless of physical distance. May produce suboptimal paths where 3 large boxes are preferred over 5 small ones.
DIJKSTRA
Dijkstra's algorithm with distance weights. Finds the shortest physical path by using euclidean distance between box centers. More accurate than BFS but explores in all directions uniformly.
ASTAR
A* algorithm with distance weights and heuristic (default). Combines Dijkstra's accuracy with a heuristic that guides the search toward the creature. Generally the fastest and most accurate option commonly used in games.
generated by TEN-LDoc (a fork of LDoc 1.4.6)