is a search algorithm which seeks to reduce the number of nodes that are evaluated by the
minimax algorithm in its search tree. It is a search with adversary algorithm used commonly for machine playing of
two-player games (Tic-tac-toe, Chess, Go, etc.). 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 score of the result of the
algorithm it optimizes