CG
2010
Springer
13 years 7 months ago
2010
Springer
The behavior of a human player in a game expresses the personality of that player. Personality is an important characteristic for modeling the player's profile. In our researc...
CG
2010
Springer
13 years 10 months ago
2010
Springer
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...
CG
2010
Springer
13 years 10 months ago
2010
Springer
Simulation balancing is a new technique to tune parameters of a playout policy for a Monte-Carlo game-playing program. So far, this algorithm had only been tested in a very artific...
CG
2010
Springer
13 years 10 months ago
2010
Springer
We used in the past a lot of computational power and human expertise for having a very big dataset of good 9x9 Go games, in order to build an opening book. We improved a lot the al...
CG
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...
CG
2010
Springer
13 years 10 months ago
2010
Springer
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
CG
2010
Springer
13 years 10 months ago
2010
Springer
Monte Carlo Tree Search has given computer go a significant boost in strength the past few years, but progress seems to have slowed, and once again we have to ask ourselves how can...
CG
2010
Springer
13 years 10 months ago
2010
Springer
We define the Rook Jumping Maze, provide historical perspective, and describe a generation method for such mazes. When applying stochastic local search algorithms to maze design, m...
CG
2010
Springer
13 years 10 months ago
2010
Springer
CG
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. For the first time, automated Hex solvers have surpassed humans in their ability to solve Hex positions: they can now solve many 9