best-first search
a general approach to heuristic search is called best-firch search, in which we choose a node in the frontier to expand on, 
, with the minimum value of some evaluation function, 
.
in that sense, best-first search is a greedy algorithm.
, with the minimum value of some evaluation function, .
in that sense, best-first search is a greedy algorithm.