(computing) A search heuristic that is based on biological evolution.

Kolmogorov complexity

An algorithm for the evolution of genotypes, which includes a selected, non-genetic component.

Informally, the property of a string being not longer than any computer program that can produce that string; that is, the property of a string being incompressible.

A step-by-step procedure, like an algorithm, but which is not guaranteed to halt on all inputs.

(Rubik's Cube) An algorithm for solving the Rubik's Cube, an improvement on Thistlethwaite's algorithm.

(Rubik's Cube) An algorithm for solving the Rubik's Cube by dividing the possible cube positions into groups.

(Rubik's Cube) An algorithm for solving the Rubik's Cube by iterative deepening.

(combination puzzles) An optimal algorithm that finds the solution with the fewest moves.

(graph theory) An algorithm that computes single-source shortest paths in a weighted digraph.