4 ms·
Yes, it’s called Monte Carlo Tree Search (MCTS used by AlphaZero) instead of AlphaBeta search (which is what classical chess engines used)
by EGreg 2y ago
Yes, it’s called Monte Carlo Tree Search (MCTS used by AlphaZero) instead of AlphaBeta search (which is what classical chess engines used)
- elcomet 2y agoThose are tree search techniques, they are not metrics to assess the "human" complexity of a line. They could be used for this purpose but out of the box they just give you winning probability
- RUnconcerned 2y agoIf multiple lines have equal-ish winning probability, rather than a single line, then you can sort of translate it to "human" complexity.