A* Pathfinding — f(n)=g(n)+h(n)

Open list picks the lowest f. g=cost so far, h=heuristic guess.

Build

Grid size

Heuristic h(n)

Movement

Placement

Obstacle density

0.26

Coach: Build grid → Run.

OPEN = candidates, CLOSED = expanded, PATH = route.

Speed

1.8×

Reveal duration

0.92s

Auto focus (collapse on Run) Show cameFrom arrows Show f/g/h on current

Expanded (closed)

Open size

Best f

—

Path length

—