Sciweavers

CG
2010
Springer
13 years 6 months ago
Extraversion in Games
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...
Giel van Lankveld, Sonny Schreurs, Pieter Spronck,...
CG
2010
Springer
13 years 9 months ago
Scalability and Parallelization of Monte-Carlo Tree Search
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...
Amine Bourki, Guillaume Chaslot, Matthieu Coulm, V...
CG
2010
Springer
13 years 9 months ago
Monte-Carlo Simulation Balancing in Practice
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...
Shih-Chieh Huang, Rémi Coulom, Shun-Shii Li...
CG
2010
Springer
13 years 9 months ago
A Principled Method for Exploiting Opening Books
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...
Romaric Gaudel, Jean-Baptiste Hoock, Julien Perez,...
CG
2010
Springer
13 years 9 months ago
Biasing Monte-Carlo Simulations through RAVE Values
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...
Arpad Rimmel, Fabien Teytaud, Olivier Teytaud
CG
2010
Springer
13 years 9 months ago
Score Bounded Monte-Carlo Tree Search
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 ...
Tristan Cazenave, Abdallah Saffidine
CG
2010
Springer
13 years 9 months ago
A Human-Computer Team Experiment for 9x9 Go
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...
Darren Cook
CG
2010
Springer
13 years 9 months ago
Rook Jumping Maze Design Considerations
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...
Todd W. Neller, Adrian Fisher, Munyaradzi T. Choga...
CG
2010
Springer
13 years 9 months ago
Enhancements for Multi-Player Monte-Carlo Tree Search
J. (Pim) A. M. Nijssen, Mark H. M. Winands
CG
2010
Springer
13 years 9 months ago
Solving Hex: Beyond Humans
Abstract. For the first time, automated Hex solvers have surpassed humans in their ability to solve Hex positions: they can now solve many 9
Broderick Arneson, Ryan B. Hayward, Philip Henders...