🧪 Interactive A* Pathfinding Simulation

This interactive simulation allows you to visualize and experiment with the A\* pathfinding algorithm, observing how it efficiently finds the shortest route through a complex environment by considering both distance and potential obstacles. By adjusting parameters like heuristic function and step size, you can directly observe the impact on the algorithm's performance and accuracy. Added a wall-density slider and a regenerate button wired into the grid's wall-placement logic, so you can test the search on sparser or denser mazes.

2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install