Alpha-beta pruning for Minimax
I have spent a whole day trying to implement minimax without really understanding it. Now, , I think I understand how minimax works, but not alpha-beta pruning. This is my understanding of minimax: Generate a list of all possible moves, up until the depth limit. Evaluate how favorable a game field is for every node on the bottom. For every node, (starting from the bottom), the score of that node is the highest score of it's children if the layer is max. If the layer is min, the score of that node is the lowest score of it's children. Perform the move that has the highest score if you are