MiniMax and NegaMax:

Finding the best move for some position on the chess board means searching through a tree of positions. At the root of the tree we search for the best successor position for the player to move, at the next level we search for the best succesor position form the standpoint of the opponent, and so on. Chess tree search is an alternation between maximizing and minimizing the value of the position in the tree.