A* Pathfinding — 2D Grid Visualizer

2D companion

Search

Algorithm Heuristic Grid size

Allow diagonal moves

Paint tool

Wall

Erase

Move start

Move goal

Start Goal Wall Frontier Explored Path

Nodes explored0

Path length—

Path found—

StatusReady

A* expands the lowest f = g + h node from a priority queue, where g is the exact cost from start and h is a heuristic estimate to the goal. Click/drag to paint walls, drag the green/red markers to move start/goal, then Run or Step through the search.