2000 character limit reached
Threes!, Fives, 1024!, and 2048 are Hard (1505.04274v1)
Published 16 May 2015 in cs.CC and cs.GT
Abstract: We analyze the computational complexity of the popular computer games Threes!, 1024!, 2048 and many of their variants. For most known versions expanded to an m x n board, we show that it is NP-hard to decide whether a given starting position can be played to reach a specific (constant) tile value.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.