Sciweavers

241 search results - page 4 / 49
» A New Computational Approach to the Game of Go
Sort
View
NETGAMES
2006
ACM
15 years 3 months ago
A new approach on wearable game design and its evaluation
As technologies evolve and computer systems shrink to the size of matchboxes, also their field of application shifts in new directions. Our permanent companions, mobile phones, p...
Christian Bertelsmeyer, Erik Koch, Alexander H. Sc...
ICGA
2008
208views Optimization» more  ICGA 2008»
14 years 9 months ago
Cross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit...
ACG
2006
Springer
15 years 3 months ago
Move-Pruning Techniques for Monte-Carlo Go
Abstract. Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers stati...
Bruno Bouzy
NETGAMES
2006
ACM
15 years 3 months ago
Meeting technology challenges of pervasive augmented reality games
Pervasive games provide a new type of game combining new technologies with the real environment of the players. While this already poses new challenges to the game developer, requ...
Wolfgang Broll, Jan Ohlenburg, Irma Lindt, Iris He...
PAAMS
2010
Springer
15 years 2 months ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier