In
computer science,
brute-force search or
exhaustive search, also known as
generate and test, is a very general problem-solving technique that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's statement.