365
click to vote
ACG
10 years 2 days ago
2015 Springer 
Abstract. Monte Carlo Tree Search (MCTS) is the state of the art algorithm for General Game Playing (GGP). We propose to learn a playout policy online so as to improve MCTS for GGP...
231
click to vote
ACG
10 years 17 days ago
2015 Springer 
UCT is a standard method of Monte Carlo tree search (MCTS) algorithms, which have been applied to various domains and have achieved remarkable success. This study proposes a family...
155
Voted
ACG
10 years 17 days ago
2015 Springer 
The simplicity of the pen-and-paper game Sprouts hides a surprising combinatorial complexity. We describe an optimisation called boundary matching that accommodates this complexity...
146
click to vote
ACG
10 years 17 days ago
2015 Springer 
Two features set slither apart from other connection games. Previously played stones can be relocated and some stone configurations are forbidden. We show that the interplay of th...
|
Computer Graphics