User:Hartadam/sandbox

A naive implementation of this approach, known as Minimax or Negamax, can only search to a small depth in a practical amount of time, so various methods have been devised to greatly speed the search for good moves. These are based on Alpha-beta pruning, Negascout, MTD-f, NegaC*.[1] The alphabeta algorithm is a method for speeding up the Minimax searching routine by pruning off cases that will not be used anyway. This method takes advantage of the knowledge that every other level in the tree will maximize and every other level will minimize.