Greedy search Evaluation function h(n)(heuristic) estimate of cost from n to the closest goal E.g.,hsLD(n)=straight-line distance from n to Bucharest Greedy search expands the node that appears to be closest to goal Chapter 4.Sections 1-2 6
Greedy search Evaluation function h(n) (heuristic) = estimate of cost from n to the closest goal E.g., hSLD(n) = straight-line distance from n to Bucharest Greedy search expands the node that appears to be closest to goal Chapter 4, Sections 1–2 6
Greedy search example Arad 366 Chapter 4.Sections 1-2 7
Greedy search example Arad 366 Chapter 4, Sections 1–2 7
Greedy search example Arad Sibiu Timisoara Zerind 253 329 374 Chapter 4.Sections 1-2 8
Greedy search example Zerind Arad Sibiu Timisoara 253 329 374 Chapter 4, Sections 1–2 8
Greedy search example Arad Sibiu Timisoara Zerind 329 374 Arad Fagaras Oradea Rimnicu Vilcea 366 176 380 193 Chapter 4.Sections 1-2 9
Greedy search example Rimnicu Vilcea Zerind Arad Sibiu Arad Fagaras Oradea Timisoara 329 374 366 176 380 193 Chapter 4, Sections 1–2 9
Greedy search example Arad Sibiu Timisoara Zerind 329 374 Arad Fagaras Oradea Rimnicu Vilcea 366 380 193 Sibiu Bucharest 253 0 Chapter 4.Sections 1-2 10
Greedy search example Rimnicu Vilcea Zerind Arad Sibiu Arad Fagaras Oradea Timisoara Sibiu Bucharest 329 374 366 380 193 253 0 Chapter 4, Sections 1–2 10