Informed Methods

Greedy Search

Use as an evaluation function f(n) = h(n), sorting nodes by increasing values of f

Selects node to expand that is believed to be closest (hence it's "greedy") to a goal node (i.e., smallest f value)
Not complete

Not admissible, as shown in the following example:

Assuming all arc costs are 1, then Greedy search will find the left goal, which has a solution cost of 5, while the optimal solution is the path to the right goal, which has a cost of 3.