How does a computer find the shortest route from A to B? Draw walls, then watch A* and Dijkstra solve the same maze. It is the same question indoor navigation answers on a checkpoint graph — shown here on a grid.
Click or drag on the grid to draw walls. Drag the green start or red goal to move them.