Use A* to find a lowest-cost path in a graph when edge costs and a goal-directed heuristic are defined and compatible with the required optimality guarantee.

Grid

Required list input.

Start

Required object input.

Goal

Required object input.

Allow diagonal movement

Optional boolean input.

Find a shortest path through a blocked rectangular grid with A* search. The tool evaluates the supplied inputs together and returns the named outputs below; it does not infer omitted operating conditions or change the units shown.^[1]

Path

The resulting path returned as an object.

• Optimality and efficiency depend on nonnegative costs, heuristic admissibility and consistency, graph representation, tie breaking, duplicate-state handling, and memory. A geometric heuristic can be invalid for arbitrary cost models.
• Use finite inputs in the displayed units and preserve more precision than the final presentation requires. Independently verify safety-critical, financial, compliance, or production decisions.

Compare against Dijkstra on small cases, verify path cost and adjacency, and benchmark heuristic quality and memory on representative maps.

• Dijkstra Shortest Path Calculator

  Find shortest paths from a start node over non-negative weighted directed edges given as [from, to, weight] rows.

• Gate Diagonal Brace Length

  Find the straight corner-to-corner brace length of a rectangular gate frame; excludes joinery and end cuts.

• Turning Blank Diameter

  Find the largest full-length round diameter that can be turned from rectangular stock without adding material.