CG
2008
Springer
13 years 7 months ago
2008
Springer
Whole-History Rating (WHR) is a new method to estimate the time-varying strengths of players involved in paired comparisons. Like many variations of the Elo rating system, the whol...
CG
2008
Springer
13 years 7 months ago
2008
Springer
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
CG
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. By developing an intelligent computer system that will provide commentary of chess moves in a comprehensible, user-friendly and instructive way, we are trying to use the ...
CG
2008
Springer
13 years 7 months ago
2008
Springer
CG
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. In this paper we review the conventional versions of nullmove pruning, and present our enhancements which allow for a deeper search with greater accuracy. While the conve...
CG
2008
Springer
13 years 7 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 ...
CG
2008
Springer
13 years 7 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...
CG
2008
Springer
13 years 7 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....
CG
2008
Springer
13 years 7 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...
CG
2008
Springer
13 years 7 months ago
2008
Springer
