Re:Introduction to Monte Carlo Tree Search
by jeffbradberry on Sunday September 13, 2015 @01:33PM
(#10212088)
Excellent. I did want to eventually write something showing how to modify this algorithm to handle games with randomness, and ISMCTS at a glance looks like it does just that. Thanks!
[ Parent
| on HN ]
Re:Introduction to Monte Carlo Tree Search
by versteegen on Monday September 14, 2015 @07:50AM
(#10214634)
Actually, you don't need information sets to handle games with chance nodes. Standard MCTS works just fine for those. (Don't use a bandit algorithm at the chance nodes, just pick randomly.) Information sets are only needed if you have uncertainty, either because players make simultaneous moves or a player doesn't know (or forgets) the complete state of the game.