DeepAI AI Chat
Log In Sign Up

ZHED is NP-complete

12/15/2021
by   Sagnik Saha, et al.
MIT
0

We prove that the 2017 puzzle game ZHED is NP-complete, even with just 1 tiles. Such a puzzle is defined by a set of unit-square 1 tiles in a square grid, and a target square of the grid. A move consists of selecting an unselected 1 tile and then filling the next unfilled square in a chosen direction from that tile (similar to Tipover and Cross Purposes). We prove NP-completeness of deciding whether the target square can be filled, by a reduction from rectilinear planar monotone 3SAT.

READ FULL TEXT

page 1

page 9

06/21/2017

Solving the Rubik's Cube Optimally is NP-complete

In this paper, we prove that optimally solving an n × n × n Rubik's Cube...
05/21/2018

Algorithmic and algebraic aspects of unshuffling permutations

A permutation is said to be a square if it can be obtained by shuffling ...
03/18/2020

Tatamibari is NP-complete

In the Nikoli pencil-and-paper game Tatamibari, a puzzle consists of an ...
04/23/2020

On the NP-Completeness of Satisfying Certain Path and Loop Puzzles

"Eye-Witless", "Haisu" and "Oriental House" are genres of logic puzzles ...
03/22/2020

1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete

Consider n^2-1 unit-square blocks in an n × n square board, where each b...
09/06/2019

NP-completeness of the game Kingdomino

Kingdomino is a board game designed by Bruno Cathala and edited by Blue ...
07/13/2023

An update on the coin-moving game on the square grid

This paper extends the work started in 2002 by Demaine, Demaine and Veri...