Greedy Search Simply greedy search always choose to visit the candidate node with the smallest estimate. That which appears to be closest to goal. Evolution function h(n)(heuristic) = estimate of cost from n to goal E.g. hsld(n) = straight-line distance from n to goal. In other words: we find a search strategy that always selects … More Greedy A* and Algorithms need in those….