Minimax Procedure
A basic technique used in game-playing programs. An expanding tree of possible moves and countermoves (moves from the opponent) is constructed. An evaluation of the final "leaves" of the tree that minimizes the opponent's ability to win and maximizes the program's ability to win is then passed back down the branches of the tree. Also known as Minimax Theorem.