800 search results - page 41 / 160 » On the Complexity of Parity Games |
AAAI
1996
13 years 10 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
ACG
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
ACG
2009
Springer
14 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...
TOC
2008
13 years 9 months ago
2008
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
DIGRA
2005
Springer
14 years 2 months ago
2005
Springer
Despite the fact that there are currently a number of enjoyable digital games in which light plays a key role, we lack a vocabulary with which to discuss simulated illumination in...