Algorithms / LIVE EXPLORATION
A Star Maze Pathfinding Visualizer
Build obstacles and watch an informed graph search discover a shortest path through the maze.
Understanding the science
A* expands the node with minimum estimated total cost f = g + h. Diagonal motion changes adjacency and movement cost.