Search algorithms

type of function that maps data of arbitrary size to data of fixed size

competitive algorithm for searching a problem space

graph search algorithm

search algorithm in sorted lists that operates by decreasing the search space by half each pass

algorithm for traversing or searching tree or graph data structures

algorithm for searching the nodes of a graph in order by their hop count from a starting node

any algorithm which solves the search problem, namely, to retrieve information stored within some data structure, or calculated in the search space of a problem domain, either with discrete or continuous values

Minimax (sometimes Minmax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, combinatorial game theory, statistics, and philosophy for minimizing the possible loss for a worst case (maximum loss) scenario. When dealing with gains, it is referred to as "maximin" – to maximize the minimum gain. Originally formulated for several-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has also been extended to more complex games and to general decision-making in the presence of u

search algorithm in unsorted lists

algorithm used for pathfinding and graph traversal

Backtracking is a class of algorithms for finding solutions to some computational problems, notably constraint satisfaction or enumeration problems, that incrementally builds candidates to the solutions, and abandons a candidate ("backtracks") as soon as it determines that the candidate cannot possibly be completed to a valid solution.

quantum unstructured search algorithm that finds with high probability the unique input to a black box function that produces a particular output value using 𝑂(𝑁) evaluations

classification algorithm

precomputed table for reversing cryptographic hash functions

computer problem-solving technique

data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets

search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree

optimization algorithm

search method used for mathematical optimization

algorithm to find shortest paths between all pairs of vertices in a sparse, edge-weighted (possibly negatively), directed graph; uses the Bellman–Ford algorithm to remove negative weights and Dijkstra’s algorithm on the rest

specialized database index to accelerate full-text search

algorithm

(as a form of proximity search (metric space)) optimization problem of finding the point in a given set that is closest (or most similar) to a given point

data structure in tree form sorted for fast lookup

heuristic search algorithm

search strategy

algorithm for finding shortest paths by simultaneously searching from the source and destination until both searches meet

Searching algorithm

D* (pronounced "D star") is any one of the following three related incremental search algorithms:

3-way tree data structure where every node's left subtree has keys less than the node's key, every middle subtree has keys equal to the node's key, and every right subtree has keys greater than the node's key

technique for finding the maximum of a unimodal function by probing a sequence of points whose distances decrease in the golden ratio at each step

hashing data structure with worst-case constant lookup time based on moving old keys to make room for new ones

collision resolution scheme

an algorithmthat produces a solution to a combinatorial puzzle with the fewest possible moves

SMA* or Simplified Memory Bounded A* is a shortest path algorithm based on the A* algorithm. The main advantage of SMA* is that it uses a bounded memory, while the A* algorithm might need exponential memory. All other characteristics of SMA* are inherited from A*.

method of searching a sorted array

technique in computer science for finding the minimum or maximum of a unimodal function

collision resolution scheme

selection of a hash function at random from a family of hash functions with a certain mathematical property, guaranteeing a low number of collisions in expectation, even if the data is chosen by an adversary

class of search algorithms

method of dimension reduction in which closer items have greater probability of being mapped to the same hash bucket

graph algorithm producing a vertex order consistent with BFS

Method for finding lost objects

set of hash functions generate no collisions

how brains and associative networks search for information

Algorithm for exact cover problem

a technique for reverting a deleted node from a circular doubly linked list

search algorithm

graph search algorithm

heuristic pathfinding algorithm

algorithm that can return a valid solution to a problem even if interrupted

SSS* is a search algorithm introduced by George Stockman in 1979. It conducts a state space search traversing a game tree in a best-first fashion similar to that of the A* search algorithm.

In constraint programming and SAT solving, backjumping (also known as non-chronological backtracking or intelligent backtracking) is an enhancement for backtracking algorithms which reduces the search space. While backtracking always goes up one level in the search tree when all values for a variable have been tested, backjumping may go up more levels. In this article, a fixed order of evaluation of variables x_1,\ldots,x_n is used, but the same considerations apply to a dynamic order of evaluation.

algorithm used to complete a sudoku

type of expansion

In computer science, B* (pronounced "B star") is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node (out of one or more possible goals). First published by Hans Berliner in 1979, it is related to the A* search algorithm.

algorithm for searching sorted, infinite lists

search algorithm

Mathematical process for constructing magic squares