Hardness of Modern Games

05/21/2020
by   Diogo M. Costa, et al.
0

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.

READ FULL TEXT

page 2

page 3

page 4

page 7

page 10

research
02/17/2022

The Complexity of SPEs in Mean-payoff Games

We establish that the subgame perfect equilibrium (SPE) threshold proble...
research
07/12/2018

Computational Complexity of Games and Puzzles

In this thesis, we survey techniques and results from the study of Compl...
research
11/21/2018

Clustering mutants favor and disfavor fixation

Exploration of the emerging patterns of mutants in a finite wild-type gr...
research
11/20/2017

Cooperative Games with Bounded Dependency Degree

Cooperative games provide a framework to study cooperation among self-in...
research
05/26/2022

Prismal view of ethics

We shall have a hard look at ethics and try to extract insights in the f...
research
05/03/2011

Parameterized Complexity of Problems in Coalitional Resource Games

Coalition formation is a key topic in multi-agent systems. Coalitions en...
research
02/23/2020

A Bridge between Polynomial Optimization and Games with Imperfect Recall

We provide several positive and negative complexity results for solving ...

Please sign up or login with your details

Forgot password? Click here to reset