Blind search algorithms do not use heuristics, but only the values of nodes that the search has visited. Examples of blind search algorithms include depth first search,
breadth first search, iterative broadening, iterative deepening
and branch and bound.
breadth first search, iterative broadening, iterative deepening
and branch and bound.
Used in Chap. 4: page 54
Used in glossary entries: branch and bound search, breadth first search, depth first search, heuristic evaluation function, iterative broadening, iterative deepening