On week 7, I helped Vincent to do pruning for our A.I. algorithms

So, what is pruning ?

Pruning is where we use the best value result from the first branch of the search tree to quickly find the best value of other branches of the tree. This is done because instead of checking all of the inside branches, we can just use the best value from the first branch and use it to compare with the first value of other inner branches.

This is done by implementing two new variables, alpha and beta, which represent the minimum score that the maximizing player is assured of and the maximum score that the minimizing player is assured of respectively.

First values for alpha is negative infinity and beta is positive infinity, which is the worst possible score for both players. This value will change later on as we make comparisons to see if we can get a better alpha/beta.