Tactical pathfinding solvers (A*, Grid). Survival Mode: Bounded iterations, no infinite loops.
Tactical pathfinding solvers (A*, Grid). Survival Mode: Bounded iterations, no infinite loops.
(a-star start
goal
neighbors-fn
heuristic-fn
{:keys [max-iter] :or {max-iter 5000}})A* Search. start, goal: Nodes (must be map keys). neighbors-fn: node -> [{:node n :cost c} ...] heuristic-fn: node -> cost options: {:max-iter 1000} Returns: {:path [nodes] :cost c :status :success/:timeout/:no-path}
A* Search.
start, goal: Nodes (must be map keys).
neighbors-fn: node -> [{:node n :cost c} ...]
heuristic-fn: node -> cost
options: {:max-iter 1000}
Returns: {:path [nodes] :cost c :status :success/:timeout/:no-path}cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |