# consistent heuristic - does it always exist?

I am studying for an artificial inteligence class, and i have to classify the following sentence

"For any search space, there is always an admissable and consistent A* heuristic".

Well, i know that there is always an admissable heuristic, for example zero, since its an underestimation of the real cost (althoug this would lead to uniform cost instead of a*).

What I would like to know is if there is always a consistent heuristic, and why.

The zero heuristic is trivially admissible, as you've noted. It's also trivially consistent as long as all step-costs are non-negative: if $h(x)=0$ for all $x$ and $c(x,y)\geq 0$ for all $x$ and $y$, then $$h(x)\leq c(x,y) + h(y)$$ for all $x$, $y$.