The minimax algorithm is a specialized search algorithm which returns the optimal sequence of moves for a player in an zero-sum game. On its own, it is too complex to be practical for a game-playing program, but there are several extensions that, taken together, make it an effective algorithm.