Y
Hacker News
new
|
ask
|
show
|
jobs
by
EGreg
547 days ago
Yes, it’s called Monte Carlo Tree Search (MCTS used by AlphaZero) instead of AlphaBeta search (which is what classical chess engines used)
1 comments
elcomet
547 days ago
Those 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
link
RUnconcerned
547 days ago
If multiple lines have equal-ish winning probability, rather than a single line, then you can sort of translate it to "human" complexity.
link