par Langerman, Stefan ;Uno, Yushi
Référence Theoretical computer science, 748, page (17-27)
Publication Publié, 2018
Article révisé par les pairs
Résumé : 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.

Documents en relation

DI-fusion