# Pokemon

Published articles for Pokemon.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Classic Nintendo Games are NP-Hard

DevFeed: [Classic Nintendo Games are NP-Hard](<https://devfeed.tech/articles/classic-nintendo-games-are-np-hard-40268.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2012/03/22/nintendo-np-hard/>)

Published: 2012-03-22T18:34:56Z

Content type: opinion

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Math and Logic](<https://devfeed.tech/topics/math-and-logic.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>), [infoarena](<https://devfeed.tech/topics/infoarena.md>)

Tags: [complexity](<https://devfeed.tech/tags/complexity.md>), [computational-complexity](<https://devfeed.tech/tags/computational-complexity.md>), [computer-science](<https://devfeed.tech/tags/computer-science.md>), [donkey-kong](<https://devfeed.tech/tags/donkey-kong.md>), [games](<https://devfeed.tech/tags/games.md>), [mario](<https://devfeed.tech/tags/mario.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [metroid](<https://devfeed.tech/tags/metroid.md>), [np-completeness](<https://devfeed.tech/tags/np-completeness.md>), [np-hard](<https://devfeed.tech/tags/np-hard.md>), [paper](<https://devfeed.tech/tags/paper.md>), [pokemon](<https://devfeed.tech/tags/pokemon.md>), [video-games](<https://devfeed.tech/tags/video-games.md>), [zelda](<https://devfeed.tech/tags/zelda.md>)

### AI overview

The article explains research showing that generalized versions of several classic Nintendo games, including Mario Brothers, Metroid, Donkey Kong, Pokemon, and The Legend of Zelda, are NP-hard. Some are also classified as NP-complete or PSPACE-complete. It outlines reductions from 3-SAT using game-level gadgets for variables and clauses.

### Source excerpt

Problem: Prove that generalized versions of Mario Brothers, Metroid, Donkey Kong, Pokemon, and Legend of Zelda are NP-hard. Solution: http://arxiv.org/abs/1203.1895v1 Discussion: Three researchers (including Erik Demaine, a computer science professor at MIT famous for his work with the mathematics of origami) recently finished a paper giving the complexity of a number of classic Nintendo games (the ones I loved to play). All are proven NP-hard, some are shown to be NP-complete, and some are PSPACE-complete.