During childhood road trips to France, the author spent hours playing Super Mario Land on a Game Boy, a game that required starting over each time due to its lack of a save feature. Recently, a study by MIT researchers revealed that many newer Super Mario games are mathematically complex, containing unsolvable problems. This research falls under theoretical computer science, which examines problem complexity and computational solutions. Simple problems, like determining if two network points are connected, belong to the “P” complexity class, where solutions scale polynomially. However, more complex problems, such as the traveling salesman problem, require exponentially more effort to solve. This study highlights the intricate challenges within video games and their connection to mathematical theory.
QUESTION: How might understanding the complexity of video games influence the way we approach problem-solving in real life?
These Super Mario levels are mathematically unsolvable
