Classic Nintendo Games are (NP-)Hard

Gaming Is a Hard Job, but Someone Has to Do It!

Giovanni Viglietta · Theory of Computing Systems · 2013 · 47 citations

Computing, Computer Science, Mathematics +12

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

Graham Cormode · 2004 · 23 citations

Computing, Computer Science, Decision Sciences +17

PushPush and Push-1 are NP-hard in 2D

Erik D. Demaine, Martin L. Demaine, Joseph O’Rourke · Smith ScholarWorks (Smith College) · 2000 · 21 citations · Full text

Computing, Computer Science, Mathematics +7