Augment the minimax algorithm with alpha-beta pruning to make it faster. 
Keep track of an alpha and beta value, which represent the minimum score that the maximizing player is assured of and the maximum score that the minimizing player is assured of respectively.
Utilize these two scores to prune branches of the search tree that cannot possibly contain the optimal move.
