Today in news we already knew: An international team of scientists has confirmed mathematically -- in a paper titled "Classic Nintendo Games are (NP-)Hard" -- that Super Mario Bros. is hard to beat.
From the paper:
Suppose there is a solution and consider any path that Mario takes through the stage. This path needs to visit every enemy at most once. The only other permanent objects in the game are potential Koopa shells, but these can only slide and fall, so they must either fall down a bottomless pit eventually and leave the game, or they enter a cycle where they bounce back and forth between two walls. In either case, the shell can be ignored, because a perfect player gains nothing by jumping on the shell to stop it. Therefore there exists a solution that is polynomial in the size of the input.