exhaustive search

Show Summary Details

Quick Reference

A mechanical search algorithm that systematically examines all the nodes in a search tree, an example being a breadth-first search. Although usually very simple to program and requiring no domain knowledge, in most cases the combinatorial explosion will prohibit the use of exhaustive search.

Subjects: Chemistry — Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.