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.
Thanks for your help