(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 Black.
Entry modified 14 April 2009.
HTML page formatted Mon May 11 15:07:57 2026.
Cite this as:
Bob Bockholt, "exhaustive search", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 14 April 2009. (accessed TODAY)
Available from: /HTML/exhaustiveSearch.html