Heuristic Function

5 flashcards · Computer Science · by Ramya Santhi Ramachandran

1. What is the other name of informed search strategy?

   Heuristic search

2. What is the heuristic function of greedy best-first search?

   f(n) = h(n)

3. Which is used to improve the performance of heuristic search?

   Quality of heuristic function

4. A heuristic is a way of trying ___________

   a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another

5. Heuristic function h(n) is ________

   Estimated cost of cheapest path from root to goal node