April 1998
Beginner
513 pages
14h 32m
English
The search processes that I describe in this chapter are something like breadth-first search, except that search does not proceed uniformly outward from the start node; instead, it proceeds preferentially through nodes that heuristic, problem-specific information indicates might be on the best path to a goal. We call such processes best-first or heuristic search. Here is the basic idea.
1. We assume that we have a heuristic (evaluation) function,
, to help decide which node is the best one to expand next. (The reason for the “hat” over the f will become apparent later. We pronounce “f-hat.”) We adopt ...
Read now
Unlock full access