A* and Dijkstra search a 3D terrain grid for the shortest path — open and closed sets highlight as the frontier expands, backtrack reveals the optimal path snaking through obstacles and elevation changes.