ACG
2015
Springer
8 years 8 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...
ACG
2015
Springer
8 years 9 months ago
2015
Springer
Abstract. Asynchronous parallel game-tree search methods are effective in improving playing strength by using many computers connected through relatively slow networks. In game po...
ACG
2015
Springer
8 years 9 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...
ACG
2015
Springer
8 years 9 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...
ACG
2015
Springer
8 years 9 months ago
2015
Springer
ACG
2015
Springer
8 years 9 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...
ACG
2015
Springer
8 years 9 months ago
2015
Springer
We present the design of a computer program for playing Progressive Chess. In this game, rather than just making one move per turn, players play progressively longer series of move...
ACG
2015
Springer
8 years 9 months ago
2015
Springer
Abstract. Recently we introduced Sibling Conspiracy Number Search — an algorithm based not on evaluation of leaf states of the search tree but, for each node, on relative evaluat...