9
Heuristic Search
9.1 Using Evaluation Functions
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 ...
Get Artificial Intelligence now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
