Learn about the mathematical analysis of the popular 2048 sliding tile game in this research seminar presentation from the Kolmogorov Seminar on computational complexity. Explore proven strategies that guarantee reaching the 256 tile and discover probabilistic approaches for achieving the 2048 tile, based on rigorous mathematical proofs and analysis. Dive into the computational complexity aspects of this engaging puzzle game through research findings presented at a joint session between the Kolmogorov Seminar and HSE's Laboratory of Computer Science, with supporting documentation available in the associated arXiv preprint.
2048 Game - Solvability Analysis up to 256 and Probabilistic Solutions to 2048
Kolmogorov-Seminar via YouTube
Overview
Syllabus
10.4.2023 Alexey Slizkov: 2048 game always solvable up to 256 and with high probability up to 2048
Taught by
Kolmogorov-Seminar