Challenge:
Weighted Directed Graph
Each node shows its heuristic estimate to Z.
Step 1
Complete the A* table. Total Distance is calculated as: distance from A + heuristic distance to Z.
-
-
Use distance so far, heuristic values and total distance to find the shortest route to Z.
Each node shows its heuristic estimate to Z.
Complete the A* table. Total Distance is calculated as: distance from A + heuristic distance to Z.