论文信息 - Restricted Power - Computational Complexity Results for Strategic Defense Games

Restricted Power - Computational Complexity Results for Strategic Defense Games

We study the game Greedy Spiders, a two-player strategic defense game, on planar graphs and show PSPACE-completeness for the problem of deciding whether one player has a winning strategy for a given instance of the game. We also generalize our results in metatheorems, which consider a large set of strategic defense games. We achieve more detailed complexity results by restricting the possible strategies of one of the players, which leads us to Sigma^p_2- and Pi^p_2-hardness results.

Ronald de Haan | Petra Wolf

[1] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[2] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .

[3] John Michael Robson,et al. N by N Checkers is Exptime Complete , 1984, SIAM J. Comput..

[4] Erik D. Demaine,et al. The Computational Complexity of Portal and Other 3D Video Games , 2018, FUN.

[5] Erik D. Demaine,et al. Constraint Logic: A Uniform Framework for Modeling Computation as Games , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[6] Giovanni Viglietta. Gaming Is a Hard Job, but Someone Has to Do It! , 2013, Theory of Computing Systems.

[7] Michal Forisek. Computational Complexity of Two-Dimensional Platform Games , 2010, FUN.

[8] Graham Kendall,et al. A Survey of NP-Complete Puzzles , 2008, J. Int. Comput. Games Assoc..

[9] John Michael Robson,et al. The Complexity of Go , 1983, IFIP Congress.

[10] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .

[11] Erik D. Demaine,et al. Classic Nintendo Games Are (Computationally) Hard , 2012, FUN.

[12] Sloman,et al. Automation of Reasoning , 1983, Symbolic Computation.

[13] Erik D. Demaine,et al. Playing Games with Algorithms: Algorithmic Combinatorial Game Theory , 2001, MFCS.