jeremykun.com

mxreY TIL in 2012 three researchers proved that many classic Nintendo games are NP-hard by developing a framework for reducing the 3SAT problem to any platform game. This means the question "given a finite level of a game, can the player move from start to finish?" is not computable in polynomial time.