Minimax alpha beta pruning in Python
I’ve recently tried to understand how minimax can be optimised. I found a great code but I was asking myself: is this code working for a tree with only three different steps ?
I’m not sure I’ve understood precisely how alpha and beta are being updated.