Corpus ID: 11770837

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

@inproceedings{Cormode2004TheHO,
  title={The Hardness of the Lemmings Game, or "Oh no, more NP-Completeness Proofs"},
  author={Graham Cormode},
  year={2004}
}

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

dimacs.rutgers.edu

Save to Library

Create Alert

Cite

Launch Research Feed