Heuristic search uses some form of heuristics to guide which areas of the search space to explore first. This is particularly important in very large search spaces (e.g. board positions in Go), or even infinite ones. Best-first search is the simplest example of a heuristic search ordering the items in the open list based on a heuristic evaluation.
Used in Chap. 4: pages 47, 55; Chap. 15: page 223
Also known as: heuristic
Used in glossary entries: Go, heuristic evaluation function, open list, search space