Informed search methods may have access to a heuristic function h(n) that estimates the value of an answer from n. The generic best-first search algorithm selects a node for expansion consistent with an evaluation function. Greedy best-first search expands nodes with minimal h(n).