a) Evaluation function returning lowest evaluation
b) Evaluation function returning highest evaluation
c) Evaluation function returning lowest & highest evaluation
d) None of them is applicable
Answer: a
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.
Related Posts
Which approach is to pretend that a pure divide and conquer algorithm will work?
What is the other name of the backward state-space search?
What is the other name for forward state-space search?
How many ways are available to solve the state-space search?
Which is the most straightforward approach for planning algorithm?
Which function is used to calculate the feasibility of whole game tree?
Which is identical to the closed list in Graph search?
Join The Discussion