2000 character limit reached
Threes!, Fives, 1024!, and 2048 are Hard
Published 16 May 2015 in cs.CC and cs.GT | (1505.04274v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.