Best first search
Used in [de Kleer & Williams 89; ...; Williams & Nayak 96]
function BFS(V, f, c) Initialize Agenda to a least cost assignment Initialize Solutions to the empty set while Agenda is non-empty do Let A be one of the least cost assignments in Agenda Remove A from Agenda if f(A) is true then Add A to Solutions endif Add immediate successor assignments of A to Agenda if enough solutions then return Solutions endif endwhile return Solutions end BFS