What problem-solving method systematically enumerates all candidates and checks if they satisfy the problem's requirements?

The brute-force search method is a systematic approach to problem-solving that involves enumerating all possible candidates for a solution to a problem and then checking each one to determine if it meets the specified requirements. This method is characterized by its exhaustive nature; it does not make any assumptions or shortcuts but instead evaluates every potential solution.

The process typically involves generating all valid configurations and then applying the criteria needed to solve the problem, ensuring a comprehensive search through the solution space. This makes brute-force search particularly effective for problems where the solution space can be feasibly explored given constraints on time or resources, even though it can be computationally intensive.

In contrast, heuristic methods rely on rules of thumb or educated guesses to find solutions, which means they may not examine every possible candidate. Iterative methods focus on refining candidates over iterations rather than exhaustively exploring all options at once. Recursive methods break problems down into smaller subproblems and solve them, often without checking every candidate in a systematic manner. Therefore, the brute-force search is fundamentally about complete enumeration and validation, making it the correct answer for the described problem-solving method.