3455 search results - page 11 / 691 » Generalized Game Trees |
99
Voted
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...
CG
2010
Springer
14 years 8 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 ...
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show that a max...
AIIDE
2008
15 years 13 days ago
2008
Dialogue in commercial games is largely created by teams of writers and designers who hand-author every line of dialogue and hand-specify the dialogue structure using finite state...
77
Voted
KI
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. In this paper we present a new symbolic algorithm for the classification, i. e. the calculation of the rewards for both players in case of optimal play, of two-player gam...