Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion.

A) Evaluation function returning highest evaluation

B) Evaluation function returning lowest evaluation

C) Evaluation function returning lowest & highest evaluation

D) None of the above

Correct Answer : Evaluation function returning lowest evaluation

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.