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},
  • Graham Cormode
  • Published 2004
  • Computer Science
  • 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… CONTINUE READING
    25 Citations
    Lemmings is PSPACE-complete
    • G. Viglietta
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 2015
    • 13
    Computational Complexity of Two-Dimensional Platform Games
    • 38
    • Highly Influenced
    • PDF
    Lemmings Is PSPACE-Complete
    • 8
    • PDF
    Classic Nintendo Games are (NP-)Hard
    • 25
    Hardness of Modern Games
    Classic Nintendo Games Are (Computationally) Hard
    • 39
    • PDF
    The Computational Complexity of Angry Birds and Similar Physics-Simulation Games
    • 7
    • PDF
    Simplified Harvest Moon is NP-Complete
    • Steven Braeger
    • Computer Science, Mathematics
    • Tiny Trans. Comput. Sci.
    • 2012
    Games, puzzles and computation
    • 167
    • PDF
    Classic Nintendo games are (computationally) hard
    • 27


    Tetris is hard, even to approximate
    • 155
    • PDF
    Partial Formalizations And The Lemmings Game
    • 9
    • PDF
    Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
    • 199
    • PDF
    Sokoban is PSPACE-complete
    • 135
    Minesweeper is NP-complete
    • 129
    SOKOBAN and other motion planning problems
    • 80
    The Computational Complexity of Motion Planning
    • 8
    • PDF