Best-first search
= Best-first search
Maintain a frontier of partial states in a <priority queue> and expand the state with the best current priority. Correctness of a particular stopping rule depends on what the priority bounds. If every descendant has smaller priority than its ancestor, the frontier maximum also bounds the priority of every unseen descendant.