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.

Topics include: Problem Solving, Uninformed Search Strategy, Uninformed Search and Exploration, Informed Search Strategy, Informed Search and Exploration, Local Search Problems and Optimization Problems, & Constraints Satisfaction Problems.