Admissible Heuristic

search

Admissible Heuristic

A heuristics function $h$ is called admissible, if for every node $n$, the following holds:

1. $h(n)\le h^{\ast }(n)$ where $h^{\ast }(n)$ is the true cost from $n$ ($h$ is “optimistic”)
2. $h(n)\ge 0$
3. $h(G)=0$ for every goal $G$