Generate a maze with DFS, then watch A* or Dijkstra find the shortest path. A* uses Manhattan distance heuristic (orange = explored, green = path). Dijkstra explores uniformly.