Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
EGreg
52 days ago
|
parent
|
context
|
favorite
| on:
Gukesh becomes the youngest chess world champion i...
Yes, it’s called Monte Carlo Tree Search (MCTS used by AlphaZero) instead of AlphaBeta search (which is what classical chess engines used)
elcomet
52 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
RUnconcerned
52 days ago
|
parent
[–]
If multiple lines have equal-ish winning probability, rather than a single line, then you can sort of translate it to "human" complexity.
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
