262 search results - page 18 / 53 » Analyzing Computer Game Narratives |
COCOA
2007
Springer
15 years 3 months ago
2007
Springer
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...
MFCS
2001
Springer
15 years 2 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
In many complex multi-agent domains it is impractical to compute exact analytic solutions. An alternate means of analysis applies computational tools to derive and analyze empiric...
FCT
2005
Springer
15 years 3 months ago
2005
Springer
Unambiguity in alternating Turing machines has received considerable attention in the context of analyzing globally-unique games by Aida et al. [ACRW04] and in the design of effic...
ACG
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Monte-Carlo tree search, especially the UCT algorithm and its enhancements, have become extremely popular. Because of the importance of this family of algorithms, a deepe...