Alpha Beta Pruning is an optimization technique for Minimax algorithms, often found in two-player Game Theory. It efficiently reduces the number of nodes that must be evaluated in a search tree by cutting off branches that cannot possibly influence the final decision.