Alpha-beta pruning is a search algorithm which seeks to reduce
the number of nodes that are evaluated in the search tree by the
minimax algorithm. In Computer science, a search algorithm,
broadly speaking is an Algorithm that takes a problem as Input
and returns a solution to the problem usually If you're looking
for game tree as it's used in game theory (not combinatorial
game theory please see Extensive form game. Minimax (sometimes
minmax) is a decision rule used in Decision theory, Game theory,
Statistics and Philosophy for mini mizing It is a search with
adversary algorithm used commonly for machine playing of two-
player games (Tic-tac-toe, Chess, Go, etc. Chess is a
recreational and competitive Game played between two players. ).
It stops completely evaluating a move when at least one
possibility has been found that proves the move to be worse than
a previously examined move. Such moves need not be evaluated
further. Alpha-beta pruning is a sound optimization in that it
does not change the result of the