Two-Player Games

The second major application of heuristic search algorithms in AI is two-player games. One of the original challenge of AI, which in fact predates the term, Artificial Intelligence, was to build a program that could play chess at the level of the best human players, a goal recently achieved.

Following are the algorithms meant to solve this problem.

Minimax Search

Alpha-Beta Pruning

Quiecence

Transposition Tables

Limited Discrepancy Search

Intelligent Backtracking

BACK:

Brute-Force Search

Search Techniques