Skip to Content

Super Mario Bros Proved NP-Hard

Ever wondered how hard those computer games really were? Now computer scientists have proved the computational complexity of various classic Nintendo games

Back in January we looked at the work of Giovanni Viglietta at the University if Pisa in Italy who had proved the computational complexity of many computer games from the 80s and 90s, such as Pac-Man and Tron.

Viglietta pointed out that this kind of analysis is unnecessary for modern games because most incorporate Turing-equivalent scripting languages that easily allow the design of undecidable puzzles as part of the gameplay.

However, that still leaves many classics that are are as yet unclassifed. 

Today, Greg Aloupis at the Free University of Brussels in Belgium and a couple of buddies fill that hole, at least in part. 

These guys prove that several classic Nintendo games from the 80s are all NP-hard. The list includes the first three incarnations of Super Mario Bros, Donkey Kong and all the Legend of Zelda games. 

All these games are essentially the same in that they start at a specific point with the aim of reaching some goal. The question Aloupis and co ask is this: given the starting position, is it possible reach the goal? 

“If it is hard to decide even this question, then it is certainly hard to find an optimal path,” they say.

In this context, they go on to show that all the games are essentially versions of another problem called 3-SAT, which is known to be NP-complete. The process here is to show that 3SAT reduces to these problems in certain circumstances, thereby proving they are NP-hard.  

So if your youth was misspent playing Super Mario Bros, Donkey Kong or any of the other games these guys prove NP-Hard, then knowing how hard they actually were might provide a little comfort that you didn’t waste your time entirely. Then again, probably not!

Ref: arxiv.org/abs/1203.1895: Classic Nintendo Games are (NP-)Hard

Keep Reading

Most Popular

open sourcing language models concept
open sourcing language models concept

Meta has built a massive new language AI—and it’s giving it away for free

Facebook’s parent company is inviting researchers to pore over and pick apart the flaws in its version of GPT-3

transplant surgery
transplant surgery

The gene-edited pig heart given to a dying patient was infected with a pig virus

The first transplant of a genetically-modified pig heart into a human may have ended prematurely because of a well-known—and avoidable—risk.

Muhammad bin Salman funds anti-aging research
Muhammad bin Salman funds anti-aging research

Saudi Arabia plans to spend $1 billion a year discovering treatments to slow aging

The oil kingdom fears that its population is aging at an accelerated rate and hopes to test drugs to reverse the problem. First up might be the diabetes drug metformin.

Yann LeCun
Yann LeCun

Yann LeCun has a bold new vision for the future of AI

One of the godfathers of deep learning pulls together old ideas to sketch out a fresh path for AI, but raises as many questions as he answers.

Stay connected

Illustration by Rose WongIllustration by Rose Wong

Get the latest updates from
MIT Technology Review

Discover special offers, top stories, upcoming events, and more.

Thank you for submitting your email!

Explore more newsletters

It looks like something went wrong.

We’re having trouble saving your preferences. Try refreshing this page and updating them one more time. If you continue to get this message, reach out to us at customer-service@technologyreview.com with a list of newsletters you’d like to receive.