论文信息 - Lemmings Is PSPACE-Complete

Lemmings Is PSPACE-Complete

Lemmings is a computer puzzle game developed by DMA Design and published by Psygnosis in 1991, in which the player has to guide a tribe of lemming creatures to safety through a hazardous landscape, by assigning them specific skills that modify their behavior in different ways. In this paper we study the optimization problem of saving the highest number of lemmings in a given landscape with a given number of available skills.

Giovanni Viglietta

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

[2] John McCarthy. Partial Formalizations And The Lemmings Game , 1998 .

[3] Erik D. Demaine,et al. Games of No Chance 3: Playing games with algorithms: Algorithmic combinatorial game theory , 2009 .

[4] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.

[5] Giovanni Viglietta. Lemmings is PSPACE-complete , 2015, Theor. Comput. Sci..

[6] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

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

[8] Graham Cormode,et al. The Hardness of the Lemmings Game, or "Oh no, more NP-Completeness Proofs" , 2004 .

[9] Giovanni Viglietta. Gaming Is a Hard Job, But Someone Has to Do It! , 2012, FUN.

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

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

[12] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

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