Exhaustive search, also called direct search, brute force search, or the "brute force" method, is an algorithm that examines every candidate in a finite search space until a solution is found or all candidates have been ruled out. More efficient algorithms may exploit the structure of the problem. Even if P≠NP, this would not imply that exhaustive search is necessary for NP-problems.
Exhaustive Search
See also
Direct Search Factorization, Method of ExhaustionExplore with Wolfram|Alpha
Cite this as:
Weisstein, Eric W. "Exhaustive Search." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/ExhaustiveSearch.html