Classic Nintendo Games are (NP-)Hard

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

21 pages, 23 figures

Scientific paper

We prove NP-hardness results for five of Nintendo's largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokemon. Our results apply to Super Mario Bros. 1, 3, Lost Levels, and Super Mario World; Donkey Kong Country 1-3; all Legend of Zelda games except Zelda II: The Adventure of Link; all Metroid games; and all Pokemon role-playing games. For Mario and Donkey Kong, we show NP-completeness. In addition, we observe that several games in the Zelda series are PSPACE-complete.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Classic Nintendo Games are (NP-)Hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Classic Nintendo Games are (NP-)Hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classic Nintendo Games are (NP-)Hard will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-18075

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.