(algorithmic technique)
Definition: An algorithm that finds a solution by trying every possibility.
See also brute force, search.
Author: BB
All the Needles in a Haystack: Can Exhaustive Search Overcome Combinatorial Chaos?
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 14 April 2009.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Bob Bockholt, "exhaustive search", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 14 April 2009. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/exhaustiveSearch.html
