============================================================
A* SEARCH RESULTS - DRONE PATH PLANNING
============================================================

INPUT SUMMARY
----------------------------------------
Terrain Size: 7 x 7
Start Position: (0, 0)
Goal Position: (6, 6)

============================================================
HEURISTIC 1: EUCLIDEAN DISTANCE
============================================================
Nodes Explored: 23
Total Path Cost: 9.6569
Path Length: 9 steps

Optimal Path:
[
 (0, 0),
 (1, 0),
 (2, 1),
 (3, 1),
 (4, 2),
 (5, 3),
 (5, 4),
 (6, 5),
 (6, 6)]

============================================================
HEURISTIC 2: OBSTACLE-AWARE (α = 0.5)
============================================================
Nodes Explored: 15
Total Path Cost: 9.6569
Path Length: 9 steps

Optimal Path:
[
 (0, 0),
 (1, 0),
 (2, 0),
 (3, 1),
 (4, 2),
 (5, 3),
 (5, 4),
 (6, 5),
 (6, 6)]
