Earlier quoted context omitted.
MCTS is a random algorithm, and AlphaGo is no exception. The AI selects a move. What state is the board in now? It doesn't know, because the opponent also selected a move. MCTS models this with a probability distribution of the states, and samples from this distribution repeatedly to build an estimate of the effectiveness of each move it could make. But what's the probability of each move made by the opponent? And af…
Be it randomized algorithm or not, LeelaZero seems to play deterministically. If given White in chess, LeelaZero plays 1. e4. Each time, every time. Guess what that means? If you're building an opening chess database vs LeelaZero (or at least, this version of LeelaZero: https://lichess.org/@/LeelaZero-UK ), you only have to worry about 1. e4 openings.
Nothing.