LM14-Informed search strategies

5 flashcards · Computer Science · by Ramya Santhi Ramachandran

1. Which search uses the problem specific knowledge beyond the definition of the problem?

   Informed search

2. What is Branching Factor?

   The average number of child nodes in the problem space graph.

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

   f(n) = h(n)

4. A* algorithm is based on __________

   Best-First-Search

5. Greedy search strategy chooses the node for expansion in ___________

   The one closest to the goal node