340
Voted
ACG
9 years 10 months 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...
215
Voted
ACG
9 years 11 months 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...
143
Voted
ACG
9 years 11 months ago
2015 Springer  141
Voted
ACG
9 years 11 months 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...
136
Voted
ACG
9 years 11 months 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