Zen Puzzle Garden is NP-complete
Computational Complexity
2011-06-13 v1
Abstract
Zen Puzzle Garden (ZPG) is a one-player puzzle game. In this paper, we prove that deciding the solvability of ZPG is NP-complete.
Cite
@article{arxiv.1106.2104,
title = {Zen Puzzle Garden is NP-complete},
author = {Robin Houston and Joseph White and Martyn Amos},
journal= {arXiv preprint arXiv:1106.2104},
year = {2011}
}
Comments
Submitted
Related papers
View all related →
Computational Complexity · Computer Science
ZHED is NP-complete
Sagnik Saha, Erik D. Demaine
2021-12-16
Computational Complexity · Computer Science
Mastermind is NP-Complete
Jeff Stuckman, Guo-Qiang Zhang
2007-05-23
Computational Complexity · Computer Science
Solitaire Chess is NP-complete
Jens Maßberg
2015-01-27
Computational Complexity · Computer Science
Sumplete is Hard, Even with Two Different Numbers
Suthee Ruangwises
2024-07-01
Computational Complexity · Computer Science
Nondango is NP-Complete
Suthee Ruangwises
2024-02-27
Data Structures and Algorithms · Computer Science
Solving Shisen-Sho boards
Michiel de Bondt
2020-10-20
Computational Complexity · Computer Science
Parks: A Doubly Infinite Family of NP-Complete Puzzles and Generalizations of A002464
Igor Minevich, Gabe Cunningham, Aditya Karan, Joshua V. Gyllinsky
2024-11-05
Artificial Intelligence · Computer Science
Ludii and XCSP: Playing and Solving Logic Puzzles
Cédric Piette, Éric Piette, Matthew Stephenson, Dennis J. N. J. Soemers +1
2019-07-02
Computational Complexity · Computer Science
Single-Player and Two-Player Buttons & Scissors Games
Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn +11
2016-07-08
Computational Complexity · Computer Science
Losing at Checkers is Hard
Jeffrey Bosboom, Spencer Congero, Erik D. Demaine, Martin L. Demaine +1
2018-06-15
Computational Complexity · Computer Science
NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
Suthee Ruangwises
2025-03-04
Computational Complexity · Computer Science
An NL-Complete Puzzle
Holger Petersen
2015-07-13
Computational Complexity · Computer Science
Yin-Yang Puzzles are NP-complete
Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno
2021-06-30
Computational Complexity · Computer Science
Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
Michael C. Chavrimootoo, Jin Seok Youn
2026-01-14
Data Structures and Algorithms · Computer Science
On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results
Michael T. Goodrich
2009-05-13
Group Theory · Mathematics
Quadratic equations over free groups are NP-complete
O. Kharlampovich, I. G. Lysenok, A. G Myasnikov, N. W. M. Touikan
2014-03-27
Computational Complexity · Computer Science
LaserTank is NP-complete
Per Alexandersson, Petter Restadh
2020-04-21
Logic in Computer Science · Computer Science
Strategic Argumentation is NP-Complete
Guido Governatori, Francesco Olivieri, Simone Scannapieco, Antonino Rotolo +1
2013-12-17
Cryptography and Security · Computer Science
How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku
Suthee Ruangwises, Toshiya Itoh
2022-10-26
Formal Languages and Automata Theory · Computer Science
Diverse Palindromic Factorization is NP-Complete
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Karkkainen +4
2020-12-15
Computational Complexity · Computer Science
Tetravex is NP-complete
Yasuhiko Takenaga, Toby Walsh
2012-04-18
Computational Complexity · Computer Science
Wataridori is NP-Complete
Suthee Ruangwises
2026-03-18
Computational Complexity · Computer Science
Classifying CELESTE as NP Complete
Zeeshan Ahmed, Alapan Chaudhuri, Kunwar Shaanjeet Singh Grover, Ashwin Rao +2
2022-12-02
Computational Complexity · Computer Science
Amazons is PSPACE-complete
Robert A. Hearn
2007-05-23
Data Structures and Algorithms · Computer Science
Gourds: a sliding-block puzzle with turning
Joep Hamersma, Marc van Kreveld, Yushi Uno, Tom C. van der Zanden
2020-11-03