NP-Hardness of a 2D, a 2.5D, and a 3D Puzzle Game

02/21/2022
by   Matthew Ferland, et al.
0

In this paper, we give simple NP-hardness reductions for three popular video games. The first is Baba Is You, an award winning 2D block puzzle game with the key premise being the ability to rewrite the rules of the game. The second is Fez, a puzzle platformer whose main draw is the ability to swap between four different 2-dimensional views of the player's position. The final is Catherine, a 3-dimensional puzzle game where the player must climb a tower of rearrangeable blocks.

READ FULL TEXT

page 3

page 4

page 5

page 6

page 7

page 10

page 12

page 13

research
04/02/2020

Dots Polygons

We present a new game, Dots Polygons, played on a planar point set. ...
research
10/19/2020

Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess is Hard

We prove PSPACE-completeness of two classic types of Chess problems when...
research
07/17/2020

Escaping a Polygon

Suppose an "escaping" player moves continuously at maximum speed 1 in th...
research
08/22/2018

Cookie Clicker

Cookie Clicker is a popular online incremental game where the goal of th...
research
02/19/2015

The (Final) countdown

The Countdown game is one of the oldest TV show running in the world. It...
research
10/09/2017

A Distributed, Dynamical System View of Finite, Static Games

This paper contains a reformulation of any n-player finite, static game ...
research
07/31/2020

Quixo Is Solved

Quixo is a two-player game played on a 5×5 grid where the players try to...

Please sign up or login with your details

Forgot password? Click here to reset