Alpha-Beta search
Uses same insight as branch and bound
When we cannot do better than the best so far
- we can cut off search in this part of the tree
More complicated because of opposite score functions
To implement this we will manipulate alpha and beta values, and store them on internal nodes in the search tree