Explore >> Select a destination
|
You are here 
|
vilela.sneslab.net | ||
| | | | |
www.jeremykun.com
|
|
| | | | | 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. | |
| | | | |
fabiensanglard.net
|
|
| | | | | ||
| | | | |
illtron.net
|
|
| | | | | I'm playing through the games featured on the covers of Nintendo Power. Join me for a deep dive into Super Mario Bros. 2! | |
| | | | |
gameinformer.com
|
|
| | | Everything gets remade, eventually. | ||
