This is a question about AI search strategies using discrete mathematics.

there are 2 admissible heuristics h1 and h2:

Code:

States:
A B C D E F G H
h1: 10,12,12,6,7,7,2,10
h2: 8, 9, 14,4,9,7,1,9

the question is to provide a new composite heuristic h3 that is admissible and dominates h1 and h2. Then show the cost of each of the states through H according to h3.

I'm not sure how to answer this question based from the information.

My guess would be that since there are already 2 effective heuristics, why not take both of them and divide them by 2, then that will create the new heurstic h3?

(h1+h2)/2 = h3

Does that seem to be on the right track?

thanks alot.