= Greedy best-first search
{title2=$f(n)=h(n)$}
<Best-first search> using only a <heuristic function> estimating remaining goal cost, without adding accumulated <path cost>. A comparator supplying the same total ordering of estimates suffices to choose expansions even if numeric estimates are unavailable. In general it need not be a <complete search algorithm> or an <optimal search algorithm>; particular stronger information or finite-<graph> policies can supply additional guarantees.
Back to article page
