Brute-force search

Definition

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

Related concepts

Algorithm Algorithmic paradigm Array (data structure)Associative array Automated theorem proving Backtracking Benchmarking Big O notation Binary digit Binary search Binary search tree Breadth-first search Brute-force attack Brute force (disambiguation)Central processing unit Chart parsing Chessboard Combinations Combinatorial explosion Computer chess Computer science Constraint Satisfaction Problem Constraint programming Constraint propagation Cryptography Curse of dimensionality Data structure Depth-first search Divide-and-conquer algorithm Divisor Dynamic programming Eight queens puzzle Evaluation function Expected value Fenwick tree Fold (higher-order function)Graph (abstract data type)Graph traversal Greedy algorithm Hash function Hash table Heap (data structure)Heuristic Heuristic (computer science)Integer Iteration Ken Thompson Key (cryptography)Key length Linear search Linked list List of algorithms List of data structures Metaheuristic Minimax Natural number Obfuscation One-time pad Online algorithm Personal computer Problem-solving Queue (abstract data type)Quintillion Randomized algorithm Recursion (computer science)Root-finding algorithm Search algorithm Segment tree Solved game Solving chess Sorting algorithm Stack (abstract data type)Strategy Streaming algorithm String-searching algorithm String (computer science)Subroutine Sudoku solving algorithms Sweep line algorithm Topological sorting Tree (abstract data type)Trie

10 concepts already in your glossary