The name "best-first search" is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the goal. All we can do is choose the node that appears to be best according to the evaluation function.

A. Heuristic B. Critical C. Value based D. Analytical E. None of the above

A. Design B. Distribution C. project management D. field service E. None of the above

A. hierarchical planning B. non-hierarchical planning C. All of the above D. project planning E. None of the above

A. The Turing Test B. LISP C. The Logic Theorist D. Cybernetics E. None of the above