563 search results - page 1 / 113 » Playing Games with Algorithms: Algorithmic Combinatorial Gam... |
MFCS
2001
Springer
14 years 1 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...
ICGA
2006
15 years 9 months ago
2006
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
CG
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...