19 search results - page 2 / 4 » Lossless abstraction of imperfect information games |
JOLLI
2010
13 years 3 months ago
2010
Abstract. When seeking to coordinate in a game with imperfect information, it is often relevant for a player to know what other players know. Keeping track of the information acqui...
ICALP
2009
Springer
14 years 1 days ago
2009
Springer
Abstract. We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players...
CG
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Years of work have gone into algorithms and optimizations for twoplayer perfect-information games such as Chess and Checkers. It is only more recently that serious resear...
CIG
2005
IEEE
13 years 7 months ago
2005
IEEE
Abstract- Monte Carlo simulations have been successfully used in classic turn–based games such as backgammon, bridge, poker, and Scrabble. In this paper, we apply the ideas to th...
CG
2002
Springer
13 years 5 months ago
2002
Springer
Abstract. This paper demonstrates the use of pattern-weights in order to develop a strategy for an automated player of a non-cooperative version of the game of Diplomacy. Diplomacy...