Please recommend a fast and efficient implementation of Monte Carlo Tree Search (Python library or github project) for board games. What I found was slow and not very efficient.
What have you tried so far? fast and efficient are attributes, not metrics. Knowing what you tried will help gauge what kind of performance you think is slow.