Explanation: A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never overestimates the cost to reach the goal. Refer both the example from the book for better understanding of the algorithms. 6. What is the other name of informed search strategy?
A. Simple search
B. Heuristic search
C. Online search
D. None of the mentioned
Answer:A
Explanation: A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never overestimates the cost to reach the goal. Refer both the example from the book for better understanding of the algorithms. 6. What is the other name of informed search strategy?
A. Simple search B. Heuristic search C. Online search D. None of the mentioned
Explanation: A key point of informed search strategy is heuristic function, So it is called as heuristic function. 7. What is the heuristic function of greedy best-first search?