Question
Data Science and Artificial Intelligence Question on Representation of Binary Tree
Let h1 and h2 be two admissible heuristics used in A* search.
Which ONE of the following expressions is always an admissible heuristic ?
A
h1 + h2
B
h1 × h2
C
h1/h2, (h2 ≠ 0)
D
|h1 - h2|
Answer
|h1 - h2|
Explanation
Solution
The correct option is (D) : |h1 - h2|.