I’m developing the game fianco (very similar to checkers) in Python and I’m trying to implement the Negamax with alpha beta pruning algorithm but as of now it’s not working as expected. It doesn’t perform the best moves when it should and I can’t understand why. Below you can find the algorithm as well as a very simple evaluation function. The undo and apply_move function are working correctly as well as the generation of the moves.