178
click to vote
CG
2008
Springer
15 years 9 months ago
2008
Springer
The UCT algorithm has been exceedingly popular for Go, a two-player game, significantly increasing the playing strength of Go programs in a very short time. This paper provides an ...
193
click to vote
CG
2008
Springer
15 years 9 months ago
2008
Springer
Monte-Carlo tree search is a powerful paradigm for the game of Go. We present a parallel Master-Slave algorithm for Monte-Carlo tree search. We experimented the algorithm on a netw...
142
Voted
CG
2008
Springer
15 years 9 months ago
2008
Springer
For the game of Hex, we find conditions under which moves into a 4-3-2 edge template are provably inferior. H.J. van den Herik et al. (Eds.): CG 2008, LNCS 5131, pp. 229-240, 2008....
166
click to vote
CG
2008
Springer
15 years 9 months ago
2008
Springer
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In this article we investigate the application of MCTS for the game Lines of Action (L...
214
click to vote
KDD
2010
ACM
15 years 9 months ago
2010
ACM
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...