Questions tagged [monte-carlo-tree-search]

This tag should be used for questions about the MCTS algorithm (how/why it works, potential applications, enhancements, combinations with other algorithms, implementation, etc.)

Filter by
Sorted by
Tagged with
12
votes
5answers
5k views

How do I choose which algorithm is best for something like a checkers board game?

I am currently new to artificial intelligence but I am very intrigued by it. I am currently researching three algorithms, namely: Minimax, Alpha-beta pruning and Monte Carlo tree search. As you may ...
2
votes
0answers
52 views

What is the time complexity of an unparellelized Monte Carlo tree search?

I am writing a report where I used a slightly modified version of MCTS (not parallelized). I thought It could be interesting if I could calculate its time complexity. I'd appreciate any help I could ...
8
votes
2answers
410 views

Does Monte Carlo Search (specifically used by AlphaZero) Qualify as Machine Learning?

To the best of my understanding, Monte Carlo Search is an alternative method to Minimax for searching a tree of nodes. It works by choosing a move (generally the one with the highest chance of being ...
5
votes
1answer
63 views

Understanding the expansion phase in Monte Carlo Tree Search

All sources I can find provide a similar explanation to each phase. In the Selection Phase, we start at the root and choose child nodes until reaching a leaf. Once the leaf is reached (assuming the ...
2
votes
1answer
156 views

Any interesting ways to combine Monte Carlo tree search with the minimax algorithm?

I've been working on a game-playing engine for about half a year now, and it uses the well known algorithms. These include minimax with alpha-beta pruning, iterative deepening, transposition tables, ...