Alpha-Beta Pruning Algorithm

Alpha–Beta Pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree

 alphabeta(origin, depth, -∞, +∞, TRUE)  
 Pseudocode alphabeta(node, depth, α, β, maximizingPlayer)  
   if depth = 0 or node is a terminal node  
     return the heuristic value of node  
   if maximizingPlayer  
     for each child of node  
       α := max(α, alphabeta(child, depth - 1, α, β, FALSE))  
       if β ≤ α  
         break (* β cut-off *)  
     return α  
   else  
     for each child of node  
       β := min(β, alphabeta(child, depth - 1, α, β, TRUE))  
       if β ≤ α  
         break (* α cut-off *)  
     return β