Instructions

Click and drag on the grid to place objects. Use the controls below to switch between placing start points, end points, or walls.

Once you've set up your grid, select an algorithm and click Play to watch the pathfinding algorithm find the shortest path!

Nodes Explored
0
Path Length
0
Time (ms)
0

A* Algorithm

A* is a best-first search algorithm that finds the shortest path between two points. It uses a heuristic function to estimate the cost to reach the goal, making it more efficient than Dijkstra's algorithm.

Sorry, this demo is best viewed on a larger screen.

You might wanna head back now.

Back to homepage
profile image
home.index