2048 without new tiles is still hard

DOI10.4230/LIPICS.FUN.2016.1MaRDI QIDQ5282798zbMATH OpenFDO

Authors Ahmed Abdelkader, Aditya Acharya, Philip Dasler

Publication date 17 July 2017

zbMATH Keywords

complexity of games2048

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Recommendations

• Threes!, Fives, 1024!, and 2048 are hard
• Threes!, Fives, 1024!, and 2048 are hard
• TETRIS IS HARD, EVEN TO APPROXIMATE
• Tetris is Hard, Even to Approximate
• Making change in 2048

Cited in

(9)

• Making change in 2048
• Push-pull block puzzles are hard
• Systematic selection of \(N\)-tuple networks for 2048
• Threes!, Fives, 1024!, and 2048 are hard
• Threes!, Fives, 1024!, and 2048 are hard
• On the complexity of Two Dots for narrow boards and few colors
• TETRIS IS HARD, EVEN TO APPROXIMATE
• Tetris is Hard, Even to Approximate
• Particle computation: complexity, algorithms, and logic

This page was built for publication: 2048 without new tiles is still hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282798)