Tetris Presents Math Problems Even Computers Can’t Solve
Tetris Presents Math Problems Even Computers Can’t Solve
Tetris Presents Math Problems Even Computers Can’t Solve
By Manon Bischoff edited by Daisy Yuhas
August 7, 2024
Summary
Tetris, the classic game launched in 1984 by Alexey Pajitnov, poses mathematical challenges that even supercomputers struggle to solve. Researchers have shown that determining if a Tetris board can be cleared relates to NP-complete problems, specifically the three-partition problem. In some cases, the game’s complexity reaches undecidability, meaning no algorithm can resolve it, even with infinite computing power. Despite this, Tetris continues to evolve with advanced play techniques, like 'rolling,' allowing players to break past perceived limits and set new records decades after the game’s release.
Reference
Bischoff, M., & Yuhas, D. (2024, August 7). Tetris presents math problems even computers can’t solve. Scientific American. https://www.scientificamerican.com/article/tetris-presents-math-problems-even-computers-cant-solve/