482
click to vote
ACG
10 years 3 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...
315
Voted
ACG
10 years 4 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...
227
click to vote
ACG
10 years 4 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...
226
Voted
ACG
10 years 4 months ago
2015 Springer  212
Voted
ACG
10 years 4 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...
|
Computer Graphics