Beam Search

Use an evaluation function f(n) = h(n), but the maximum size of the nodes list is k, a fixed constant
Only keeps k best nodes as candidates for expansion, and throws the rest away
More space efficient than Greedy Search, but may throw away a node that is on a solution path
Not complete
Not admissible