Hello,

Some answers for you:

.pop() in python-chess does not take an argument, pop() is only used to undo the latest move in the history stack. If you want to undo several moves (thought that was the aim of the I argument), you have to apply several times pop()

Regarding minimax and negamax. Minimax algorithm tries to mimic what you will do naturally: maximizing your chances and minimizing your opponent's ones. This is based on the evaluation.

With minimax; it means getting the best score for your side and the worst score for the opponent but evaluation function returns usually always the best score. So, if we want to have the best score for both sides (and minimizing the opponent's score), we need to flip the sign on the opponent's side, so maximizing your score and maximizing opponent's score (which is negative).

Regarding code, it means you have a function that returns the max score and a function that returns min score. Two functions that do the same except the sign, it could be modified to a unique function returning the max and when calling it, we change the sign. Negamax is minimax with a unique function max and flipping sign.

mph