Draw walls, then watch A* (or Dijkstra) find the shortest path. A* uses Manhattan/Euclidean heuristic to guide search toward the goal — far fewer nodes explored.