Classic Nintendo Games are Hard

NP-Hard to be exact.   A specific form of problem that has many examples, the traveling salesman problem is known to be NP-Hard, that cannot be solved by a cadre of computers that can do things that computers still cannot do today. A technical discussion. I am not sure exactly what this means in a practical sense today,  but it is to me a surprising result.