[P] Monte Carlo Tree Search library in Python
While I was building an AlphaZero clone I had the opportunity to make a Python library for the Monte Carlo Tree Search algorithm that works both with an AI expert policy or without one. The existing Python libraries that I found were either too poorly functioning/documented or didn’t have a clear mechanism for deriving the probabilistic exploratory weighting to assign to a child node prior to determining its predicted win value.
Please let me know if there are any issues or if I can help clarify anything. I hope someone might find this useful!