2000 character limit reached
Hardness of Modern Games (2005.10506v1)
Published 21 May 2020 in cs.CC and cs.GT
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.