Combinatorial search

Combinatorial search
Combinatorial search is a branch of computer science that sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering.

The name combinatorial search is generally used for algorithms that look for a specific sub-structure of a given discrete structure, such as a graph, a string, a finite group, and so on.

Examples of best-first search algorithms include Dijkstra's algorithm and the A-star search algorithm. Best-first algorithms are often used for pathfinding in combinatorial search.
See also ...

A recent variation called delayed-Q learning has shown substantial improvements, bringing PAC bounds to Markov Decision Processes. Reinforcement learning applications have ranged from robotics, to industrial manufacturing, to combinatorial search ...

See also: Knowledge, Artificial intelligence, Branch, Heuristics, Search algorithm