Corpus ID: 11770837

The Hardness of the Lemmings Game, or "Oh no, more NP-Completeness Proofs"

  title={The Hardness of the Lemmings Game, or "Oh no, more NP-Completeness Proofs"},
  author={Graham Cormode},
In the computer game ‘Lemmings’, the player must guide a tribe of green-haired lemming creatures to safety, and save them from an untimely demise. We formulate the decision problem which is, given a level of the game, to decide whether it is possible to complete the level (and hence to find a solution to that level). Under certain limitations, this can be decided in polynomial time, but in general the problem is shown to be NP-Hard. This can hold even if there is only a single lemming to save… Expand
Lemmings is PSPACE-complete
  • G. Viglietta
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2015
It is proved that the game is PSPACE-complete, even if there is only one lemming to save, and only Builder and Basher skills are available, and it is shown that saving the maximum number of lemmings is APX-hard, even when only one type of skill is available, whatever this skill is. Expand
Computational Complexity of Two-Dimensional Platform Games
We analyze the computational complexity of various two-dimensional platform games. We state and prove several meta-theorems that identify a class of these games for which the set of solvable levelsExpand
Lemmings Is PSPACE-Complete
The optimization problem of saving the highest number of lemmings in a given landscape with a given number of available skills is studied. Expand
Hardness of Modern Games
This work considers the complexity properties of modern puzzle games, Hexiom, Cut the Rope and Back to Bed, and gives further insight into the structure of these games and the resulting constructions may be useful in further complexity studies. Expand
Classic Nintendo Games are (NP-)Hard
This work proves NP-hardness results for five of Nintendo’s largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokémon, and observes that several games in the Zelda series are PSPACE-complete. Expand
The Computational Complexity of Angry Birds and Similar Physics-Simulation Games
By using a combination of different gadgets within this game’s environment, it is demonstrated that the problem of solving Angry Birds levels is NP-hard, and the original version of Angry Birds is within NP and therefore also NP-complete. Expand
Classic Nintendo Games Are (Computationally) Hard
These results apply to generalized versions of Super Mario Bros. 1, 3, Lost Levels, and Super Mario World; Donkey Kong Country 1–3; all Legend of Zelda games; all Metroid games; and all Pokemon role-playing games. Expand
Simplified Harvest Moon is NP-Complete
  • S. Braeger
  • Computer Science, Mathematics
  • Tiny Trans. Comput. Sci.
  • 2012
A proof that SHM is NP-complete is presented using the Bounded Knapsack Problem (BKP) and it is shown that there exists a trivial bijection from all instances of BKP to all instance of Simplified Harvest Moon (SHM). Expand
On the complexity of Katamari Damacy
The complexity of algorithm-based games has been of interest to computer scientists for a long time and the types of games that typically receive attention are single player puzzle games, two player board games, and mathematical games. Expand
The Computational Complexity of Angry Birds
This paper is the first time that a single-player game has been proven EXPTIME-complete, and uses stochastic game engine dynamics to effectively model the real world, or in this case the physics simulator, as the opponent against which the authors are playing. Expand


Tetris is hard, even to approximate
It is proved that in the offline version of Tetris, it is -complete to maximize the number of cleared rows, maximize theNumber of tetrises (quadruples of rows simultaneously filled and cleared), minimize the maximum height of an occupied square, or maximize thenumber of pieces placed before the game ends. Expand
Partial Formalizations And The Lemmings Game
The features of the Lemmings world that make it a challenge to both experimental and theoretical AI and some steps toward formalizing the game using situation calculus are discussed. Expand
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
Background in combinatorial game theory is reviewed, which analyzes ideal play in perfect-information games and results about the complexity of determining ideal play are surveyed, in terms of both polynomial-time algorithms and computational intractability results. Expand
Sokoban is PSPACE-complete
It is shown that the popular puzzle Sokoban can be used to emulate a linear bounded automata and shows that the puzzles are PSPACE-complete, solving the open problem stated in 1. Expand
Minesweeper is NP-complete
NP-completeness Many programming p rob lems require the design of an algor i thm which has a "yes" or "no" ou tput for each input. For example , the p rob lem of test ing a whole number for pr imal iExpand
On the Complexity of the “ Reflections ” game David Kempe January 2 , 2003
The game “Reflections” is a puzzle game that has been around and entertaining users in various versions for many years. A single player tries to hit a given set of light bulbs with a laser beam, byExpand
SOKOBAN and other motion planning problems
A natural family of motion planning problems with movable obstacles and some members of the family are shown to be PSPACE-complete thus improving and extending (and also simplifying) a previous NP-hardness result of Wilfong. Expand
The Computational Complexity of Motion Planning
In this paper we show that a generalization of a popular motion planning puzzle called Lunar Lockout is computationally intractable. In particular, we show that the problem is PSPACE-complete. WeExpand