SIMULATION CANVASRUNNING
Adjust the controls to explore the model.
Watch an informed search algorithm explore a grid, compare heuristics and reconstruct the shortest route.
Live model · Adjustable parameters · Real-time feedbackA* ranks frontier cells by f(n) = g(n) + h(n), combining the known path cost with an estimate to the goal. Manhattan and Euclidean heuristics guide the search differently. Click empty cells to add or remove walls.
Change one parameter at a time, observe the response, then reset and compare. The model runs locally in your browser and does not require an account or external libraries.