Do I need to install anything?

No. It runs in any modern browser, free, with no account required.

For K-12 Students · A* Pathfinding

A* Pathfinding for a hash table

Built for k-12 students learning it in middle or high school. Watch the idea come alive with plain-language steps and everyday examples — perfect for projects and homework. Simulate a hash table live below — adjust the inputs and watch it respond, right in your browser.

Pathfinding (A* / Dijkstra)Live

grid search · draw walls

Controls

Drag on the grid to draw walls. A* uses a distance heuristic to head straight for the goal; Dijkstra explores blindly in all directions. Blue = start, pink = goal, green = shortest path.

▶ Run in Python

Data Inspector

AlgorithmA*

Grid48×30

HeuristicManhattan

Governing equation

f (n) = g (n) + h (n), h (n) = ∣Δ x ∣ + ∣Δ y ∣

Reading this result: A* adds the Manhattan-distance heuristic to Dijkstra, so it aims straight at the goal and expands far fewer cells while still returning a shortest path.

Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.

or unlock everything with Pro →

Also for:Students Researchers Educators Engineers Hobbyists & Makers First Responders General version →

More with A* Pathfinding

A* Pathfinding for a neural network A* Pathfinding for a sorting algorithm A* Pathfinding for a search tree A* Pathfinding for a recommendation engine A* Pathfinding for an image classifier A* Pathfinding for a chatbot A* Pathfinding for a pathfinding AI A* Pathfinding for a game AI

Frequently asked questions

Is this good for k-12 students?: Yes — this version of "A* Pathfinding for a hash table" is framed for k-12 students learning it in middle or high school. Watch the idea come alive with plain-language steps and everyday examples — perfect for projects and homework.
Do I need to install anything?: No. It runs in any modern browser, free, with no account required.