Dominant Heuristic

search

Definition

Dominant Heuristic

For admissible heuristics $h_1$ and $h_2$, we say $h_2$ dominates $h_1$, if $h_2(n)\ge h_1(n)$ for every node $n$.

Trivially, if $h_1,h_2$ are admissible heuristics, then also the heuristic $h(n)=\max (h_1(n),h_2(n))$ is admissible, and it dominates $h_1,h_2$.