Machine-translated by Google. Questions are authored in English.
Top

Discussion

What is Monte Carlo tree search?

  • A.Selecting moves at random from among all of the plausible ones
  • B.Sampling positions from a database of recorded games
  • C.Estimating position values by averaging many random playouts
  • D.Searching the tree in a randomly chosen order each time

Answer: C

MCTS plays many games out to the end from a position, averaging the results to estimate its value, and grows the tree preferentially where the estimates are promising or uncertain. It needs no hand written evaluation function, which is why it transformed computer go. Random traversal, random move choice and database sampling are different ideas. Replacing a hand crafted estimate with a statistical one obtained by simulation is a change of kind rather than of degree.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.