What criterion is commonly used by Greedy Best First Search to select the next node?
Options
- A. The heuristic value h(n)
- B. The path cost g(n) only
- C. The depth of the node only
- D. More than one of the above
- E. None of the above
Quiz Practice:
A. The heuristic value h(n)
Best First Search, particularly Greedy Best First Search, selects the node that appears most promising according to an evaluation function. In Greedy Best First Search, the evaluation is typically f(n) = h(n).