Paper Info
Title
Threes!, Fives, 1024!, and 2048 are Hard
Abstract
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 × 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.
Year
DOI
Venue
2015
10.4230/LIPIcs.FUN.2016.22
fun with algorithms
Field
DocType
Volume
Discrete mathematics,Combinatorics,Tile,Mathematics,Computational complexity theory
Journal
abs/1505.04274
Citations 
PageRank 
References 
0
0.34
2
Authors
2
Name
Order
Citations
PageRank
Stefan Langerman1831101.66
yushi uno222228.80