MST
2011
13 years 7 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
EJC
2007
14 years 21 days ago
2007
Let A and B be hypergraphs with a common vertex set V . In a (p, q, A ∪ B) Bart-Moe game, the players take turns selecting previously unclaimed vertices of V . The game ends whe...
ACG
2006
Springer
14 years 6 months ago
2006
Springer
First, this paper introduces a new family of k-in-a-row games, Connect(m, n, k, p, q). In Connect(m, n, k, p, q), two players alternately place p stones on an m × n board in each ...
TACAS
2009
Springer
14 years 7 months ago
2009
Springer
Alpaga is a solver for parity games with imperfect information. Given the description of a game, it determines whether the first player can ensure to win and, if so, it constructs...