 Informed search and exploration by Stuart Russell and Peter Norvig

Author-provided chapter: aima.cs.berkeley.edu/4th-ed/pdfs/newchap04.pdf

Printed section 4.1, especially pp. 97–100, discusses greedy best-first search, A-star search, admissible heuristics and the finite-branching factor/positive-cost completeness conditions. The printed chapter identity is used without inferring an edition from its host directory.