Alpha-beta pruning is an optimization technique used in game tree search to reduce the number of nodes evaluated by the minimax algorithm. It works by pruning branches that cannot possibly change the outcome. This reduces calculation time and allows problems to be solved faster by cutting off parts of the game tree that do not need to be analyzed. Alpha represents the best score the maximizing player can guarantee, and beta represents the best score the minimizing player can guarantee.