1 vote

How do we know that $c(n,a,G) = h^{\ast}(n)$, in the proof that if a heuristic is consistent then it is admissible?

$c(n, a, G) = h^*(n)$ is true because $h^*$ is the optimal heuristic, i.e. it gives you the minimal/optimal cost from $n$ to the goal $G$, which, in that base case, is exactly $c(n, a, G)$, i.e. the ...
nbro's user avatar
  • 40.2k
1 vote

How to determine that an heuristic is admissible

It is often possible to construct a heuristic which is a provable lower bound on a cost. For instance, on any path search in a metric space (one with consistent measurements between items), you can ...
Neil Slater's user avatar
  • 31.7k

Only top scored, non community-wiki answers of a minimum length are eligible