Heuristic Search in Bounded-depth Trees: Best-Leaf-First Search


Many combinatorial optimization and constraint satisfaction problems can be formulated as a search for the best leaf in a tree of bounded depth. When exhaustive enumeration is infeasible, a rational strategy visits leaves in increasing order of predicted cost. Previous systematic algorithms for this setting follow predetermined search orders, making strong… (More)


8 Figures and Tables