Python MCTS Function is always choosing the last available move instead of the best one
I’ve been writing a MCTS implementation in Python 3. It doesn’t have any code errors, however, the searcher always picks the last move available rather than the optimal one.