Also known as: Brute force Search
Brute-force search is a problem-solving method that systematically enumerates possible candidate solutions and checks whether each satisfies the required condition. It is simple and broadly applicable but often computationally inefficient for large search spaces.
(Also exhaustive search or generate and test.) A very general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's statement. Although simple to implement, brute force search is often inefficient for large problem spaces due to its high computational cost.