Edit map — click grid

Playback

Expansion speed: 6 nodes/step

A* search (f = g + h)

Nodes expanded0

Path cost—

Path length (cells)—

Dijkstra (h = 0)

Nodes expanded0

Path cost—

Path length (cells)—

Comparison

Nodes saved by A*—

Same optimal cost?—

wall open set closed set shortest path start goal

Left grid runs true A* (f = g + h, octile-distance heuristic). Right grid runs plain Dijkstra (identical map, heuristic forced to 0 — equivalent to uniform-cost search). Both use a genuine binary-heap priority queue over the identical obstacle map, so any difference in nodes expanded is a real algorithmic effect, not a canned number.