Explanation: Informed search strategies uses some problem specific knowledge, hence more efficient to finding goals. 5. Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion.
A. Evaluation function returning lowest evaluation
B. Evaluation function returning highest evaluation
C. Both a & b can be used
D. None of them is applicable
Answer:A
Explanation: Informed search strategies uses some problem specific knowledge, hence more efficient to finding goals. 5. Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion.
A. Evaluation function returning lowest evaluation B. Evaluation function returning highest evaluation C. Both a & b can be used D. None of them is applicable
Explanation: Best-first search is an instance of the general TREE-SEARCH or GRAPH-SEARCH algorithm in which a node is selected for expansion based on an evaluation function, f (n) . Traditionally, the node with the lowest evaluation is selected for expansion, because the evaluation measures distance to the goal. 6. Best-First search can be implemented using the following data structure.