Clash Blueprint Engine API
    Preparing search index...

    Function aStar

    • Weighted A* on a 4-connected tile grid. The key idea for this engine: walls are not impassable — enterCost returns their break-time — so the same search that finds a route also decides when cutting through a wall beats walking around it. Ties break deterministically (lower h, then lower index) so a given layout always yields the same path.

      Parameters

      Returns PathResult | null