Search algorithms

A* search algorithm - In computer science, A* is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently traversable path between points, called nodes.

Aho–Corasick string matching algorithm - The Aho–Corasick string matching algorithm is a string searching algorithm invented by Alfred V. Aho and Margaret J. Corasick.

All nearest smaller values - In computer science, the all nearest smaller values problem involves computing, for each value in a sequence of numbers, the previous smaller value that has the closest position in the sequence ...

Alpha-beta pruning - Alpha-beta pruning is a search algorithm which seeks to reduce the number of nodes that are evaluated by the minimax algorithm in its search tree.

Amplitude amplification - Amplitude amplification is a technique in quantum computing which generalizes the idea behind the Grover's search algorithm, and gives rise to a family of quantum algorithms.

B* - In computer science, B* is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node.

Backjumping - In backtracking algorithms, backjumping is a technique that reduces search space, therefore increasing efficiency.

Backtracking - Backtracking is a general algorithm for finding all solutions to some computational problem, that incrementally builds candidates to the solutions, and abandons each partial candidate c as ...

Beam search - Beam search is a heuristic search algorithm that is an optimization of best-first search that reduces its memory requirement.

Beam stack search - Beam Stack Search is a search algorithm that combines chronological backtracking with beam search and is similar to Depth-First Beam Search.

C-Link - C-Link is new search tool for finding related and possibly unknown concepts that lie on a path between two known concept.

Cuckoo hashing - Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table.

Dancing Links - In computer science, Dancing Links, also known as DLX, is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. Algorithm X is a recursive, nondeterministic, de...

Deducting Search Algorithm - The Deducting Search Algorithm, also known as the Holmes Engine after the author Sir Arthur Conan Doyle’s famous sleuth, is a mathematical formula that interprets the choices made by the s...

Depth-first search - Depth-first search is an algorithm for traversing or searching a tree, tree structure, or graph.

Depth-limited search - In computer science depth-limited search is an algorithm to explore the vertices of a graph.

Expectiminimax tree - An expectiminimax tree is a specialized variation of a minimax game tree for use in artificial intelligence systems that play two-player zero-sum games such as backgammon, in which the outcome d...

Extendible hashing - Extendible hashing is a type of hash system which treats a hash as a bit string, and uses a trie for bucket lookup.

Fibonacci search technique - The Fibonacci search technique is a method of searching a sorted array using a divide and conquer algorithm that narrows down possible locations with the aid of Fibonacci numbers.

Fractional cascading - In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures.

Genetic algorithm - The genetic algorithm is a search heuristic that mimics the process of natural evolution.

Geometric hashing - In computer science, geometric hashing is a method for efficiently finding two-dimensional objects represented by discrete points that have undergone an affine transformation.

God's algorithm - God's algorithm is a notion originating in discussions of ways to solve the Rubik's Cube puzzle, but which can also be applied to other combinatorial puzzles and mathematical games.

Graphplan - Graphplan is an algorithm for automated planning developed by Avrim Blum and Merrick Furst in 1995.

Grover's algorithm - Grover's algorithm is a quantum algorithm for searching an unsorted database with N entries in O time and using O storage space.

Hash function - A hash function is any well-defined procedure or mathematical function that converts a large, possibly variable-sized amount of data into a small datum, usually a single integer that may serve a...

Hash table - In computer science, a hash table or hash map is a data structure that uses a hash function to map identifying values, known as keys to their associated values.

Hill climbing - In computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search.

Hopscotch hashing - Hopscotch hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table using open addressing.

IDA* - IDA* is a variant of the A* search algorithm which uses iterative deepening to keep the memory usage lower than in A*.

Incremental heuristic search - Incremental search has been studied at least since the late 1960s.

Index mapping - Index mapping is a computer science term that is used to describe the mapping of raw data, used directly as in array index, for an array.

Interpolation search - Interpolation search is an algorithm for searching for a given key value in an indexed array that has been ordered by the values of the key.

Inverted index - In computer science, an inverted index is an index data structure storing a mapping from content, such as words or numbers, to its locations in a database file, or in a document or a set of docu...

Jump search - In computer science, a jump search or block search refers to a search algorithm for ordered lists.

k-nearest neighbor algorithm - In pattern recognition, the k-nearest neighbours algorithm is a method for classifying objects based on closest training examples in the feature space.

Knuth's Algorithm X - Donald Knuth's Algorithm X is a recursive, nondeterministic, depth-first, backtracking algorithm that finds all solutions to the exact cover problem represented by a matrix A consisting of 0...

Knuth–Morris–Pratt algorithm - The Knuth–Morris–Pratt string searching algorithm searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch occurs, the word itself e...

Late Move Reductions - Late Move Reductions is a non-game specific enhancement to the alpha-beta algorithm and its variants which attempts to examine a game search tree more efficiently.

Lexicographic breadth-first search - In computer science, lexicographic breadth-first search or Lex-BFS is a linear time algorithm for ordering the vertices of a graph, that is used as part of other graph algorithms such as the rec...

Linear hashing - Linear hashing is a dynamic hash table algorithm invented by Witold Litwin, and later popularized by Paul Larson.

Linear search - In computer science, linear search or sequential search is a method for finding a particular value in a list, that consists of checking every one of its elements, one at a time and in sequ...

Locality sensitive hashing - Locality Sensitive Hashing is a method of performing probabilistic dimension reduction of high-dimensional data.

MaMF - MaMF, or Mammalian Motif Finder, is an algorithm for identifying motifs to which transcription factors bind.

Minimax - Minimax is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss while maximizing the potential gain.

MTD-f - MTD, an abbreviation of MTD is a minimax search algorithm, an alternative to the alpha-beta pruning algorithm.

Nearest neighbor search - Nearest neighbor search, also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces.

Null-move heuristic - In computer chess programs, the null-move heuristic is a heuristic technique used to enhance the speed of the alpha-beta pruning algorithm.

Perfect hash function - A perfect hash function for a set S is a hash function that maps distinct elements in S to distinct integers, with no collisions.

Phrase search - Phrase Search is a type of full text search that matches only those documents that contain a specified phrase, such as "Wikipedia, the free encyclopedia.

Proof-number search - Proof-number search is a game tree search algorithm invented by Victor Allis, with applications mostly in endgame solvers, but also for sub-goals during games.

Rabin–Karp string search algorithm - The Rabin–Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find any one of a set of pattern strings in a text.

Rainbow table - A rainbow table is a lookup table offering a time-memory tradeoff used in recovering the plaintext password from a password hash generated by a hash function, often a cryptographic hash function.

Rapidly-exploring dense trees - Rapidly-exploring Dense Trees is a family of planning algorithms that includes Rapidly-exploring_random_tree.

Rapidly-exploring random tree - A Rapidly-exploring Random Tree is a data structure and algorithm designed for efficiently searching nonconvex, high-dimensional search spaces.

Search algorithm - In computer science, a search algorithm, broadly speaking, is an algorithm for finding an item with specified properties among a collection of items.

Search games - A search game is a two-person zero-sum game which takes place in a set called the search space.

Search suggest drop-down list - A search suggest drop-down list is a query feature used in computing.

Semi-linear resolution - Semi-Linear Resolution is a search strategy that is based on an iteratively-deepening depth-first search.

Siamese method - The Siamese method, or De la Loubère method, is a simple method to construct any size of n-odd magic squares.

Ternary search - A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a unimodal function.

Ternary search tree - In computer science, a ternary search tree is a ternary tree data structure of strings which combines the speed of a prefix search tree, or trie, with the space efficiency of a binary search tree.

Trigram search - Trigram search is a powerful method of searching for text when the exact syntax or spelling of the target object is not precisely known.

Uniform binary search - Uniform binary search is an optimization of the classic binary search algorithm invented by Donald Knuth and given in Knuth's The Art of Computer Programming.

Uniform-cost search - In computer science, uniform-cost search is a tree search algorithm used for traversing or searching a weighted tree, tree structure, or graph.

Universal hashing - Universal hashing is a randomized algorithm for selecting a hash function F with the following property: for any two distinct inputs x and y, the probability that F=F is the same...

UUHash - UUHash is a hash algorithm employed by clients on the FastTrack network.

Variation (game tree) - A Variation can refer to a specific sequence of successive moves in a turn-based game, often used to specify a hypothetical future state of a game that is being played.

Zhu–Takaoka string matching algorithm - The Zhu–Takaoka string matching algorithm is a variant of the Boyer–Moore string search algorithm.