In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible h … … . h heuristics 1 m is available for a problem and none of them dominates any of the others, which should we choose?

1. Ah(n) = max{h₁(n), …, hₘ(n)}
2. Bh(n) = min{h₁(n), …, hₘ(n)}
3. Ch(n) = avg{h₁(n), …, hₘ(n)}
4. Dh(n) = sum{h₁(n), …, hₘ(n)}

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: A. h(n) = max{h₁(n), …, hₘ(n)}

Explanation

The max of admissible heuristics is still admissible and dominates each one, giving the most informed estimate.