Car Maze with Incrementally Revealed Neighbors (DFS)

Requirements You are given an API with these operations: current_position() identifies the car's starting position. neighbors(position) returns the positions reachable from the supplied position, but those connections become known only after the position is visited. is_goal(position) determines whether a position is the destination. The complete map is unavailable initially; the car must discover connectivity by visiting positions. Return a path from the start to the goal,…