English

Hardness of Modern Games

Computational Complexity 2020-05-22 v1 Computer Science and Game Theory

Abstract

We consider the complexity properties of modern puzzle games, Hexiom, Cut the Rope and Back to Bed. The complexity of games plays an important role in the type of experience they provide to players. Back to Bed is shown to be PSPACE-Hard and the first two are shown to be NP-Hard. These results give further insight into the structure of these games and the resulting constructions may be useful in further complexity studies.

Keywords

Cite

@article{arxiv.2005.10506,
  title  = {Hardness of Modern Games},
  author = {Diogo M. Costa and Alexandre P. Francisco and Luís M. S. Russo},
  journal= {arXiv preprint arXiv:2005.10506},
  year   = {2020}
}

Comments

The work reported in this article was supported by national funds through Funda\c{c}\~ao para a Ci\^encia e Tecnologia (FCT) through projects NGPHYLO PTDC/CCI-BIO/29676/2017 and UID/CEC/50021/2019. Funded in part by European Union Horizon 2020 research and innovation programme under the Marie Sk{\l}odowska-Curie Actions grant agreement No 690941