Sciweavers

3455 search results - page 9 / 691
» Generalized Game Trees
Sort
View
CG
2010
Springer
14 years 8 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
AAAI
2010
14 years 11 months ago
A General Game Description Language for Incomplete Information Games
A General Game Player is a system that can play previously unknown games given nothing but their rules. The Game Description Language (GDL) has been developed as a highlevel knowl...
Michael Thielscher
ECML
2007
Springer
15 years 4 months ago
Graph-Based Domain Mapping for Transfer Learning in General Games
A general game player is an agent capable of taking as input a description of a game’s rules in a formal language and proceeding to play without any subsequent human input. To do...
Gregory Kuhlmann, Peter Stone
ICGA
2008
208views Optimization» more  ICGA 2008»
14 years 10 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...
NOSSDAV
2005
Springer
15 years 3 months ago
Using n-trees for scalable event ordering in peer-to-peer games
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
Chris GauthierDickey, Virginia Mary Lo, Daniel Zap...