Threes!, Fives, 1024!, and 2048 are hard

DOI10.1016/j.tcs.2018.03.018zbMath1402.68101arXiv1505.04274MaRDI QIDQ1623263

Stefan Langerman, Yushi Uno

Publication date: 23 November 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.04274

zbMATH Keywords

algorithmic combinatorial game theory

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

91A46: Combinatorial games