ABSTRACT
Games involving two players represent one of the classic applications of symbolic problem solving. Starting with some initial game position, the algorithm explores the tree of all legal moves down to the requested depth. A simplified version is the nim game with no piles, the five pennies nim game. Two players alternate remove either one, two, or three pennies from a stack that initially contains five pennies. The five pennies nim game is a zero game where neither player has any legal options. The minimax-algorithm explores the tree of all legal moves down to the requested depth. Scores associated with leaves of the tree are calculated using an evaluation function.
