SNOWMAN is PSPACE-complete

被引：2

作者：

He, Weihua ^{[1
]}

Liu, Ziwen ^{[2
]}

Yang, Chao ^{[3
]}

机构：

[1] Guangdong Univ Technol, Dept Appl Math, Guangzhou, Guangdong, Peoples R China

[2] South China Univ Technol, Sch Software Engn, Guangzhou, Guangdong, Peoples R China

[3] Sun Yat Sen Univ, Sch Math, Guangzhou, Guangdong, Peoples R China

来源：

THEORETICAL COMPUTER SCIENCE | 2017年 / 677卷

基金：

中国国家自然科学基金;

关键词：

Combinatorial puzzles; Computational complexity; PSPACE-complete; Sokoban; Nondeterministic constraint logic;

D O I：

10.1016/j.tcs.2017.03.011

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

SOKOBAN is one of the most studied combinatorial puzzle game in the literature. Its computational complexity was first shown to be PSPACE-complete in 1997. A new proof of this result was obtained by Hearn and Demaine (2005) [8], by introducing the Nondeterministic Constraint Logic (N-CL) problem. Since then, N-CL has been used to prove the PSPACE-completeness of several other puzzles including a few SOKOBAN variants, by many authors. In this paper, we show that SNOWMAN, a new SoxosAN-like puzzle game released in 2015, is PSPACE-complete by reduction from N-CL. (C) 2017 Elsevier B.V. All rights reserved.

引用

页码：31 / 40

页数：10

共 50 条

[41] Dynamic Point Labeling is Strongly PSPACE-Complete
Buchin, Kevin
Gerrits, Dirk H. P.
ALGORITHMS AND COMPUTATION, 2013, 8283 : 262 - 272
[42] Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete
Majster-Cederbaum, Mila
Semmelrock, Nils
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (138): : 1 - 11
[43] Strong bisimilarity on basic parallel processes is PSPACE-complete
Jancar, P
18TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2003, : 218 - 227
[44] Bounded-variable fixpoint queries are PSPACE-complete
Dziembowski, S
COMPUTER SCIENCE LOGIC, 1997, 1258 : 89 - 105
[45] Bisimilarity of One-Counter Processes Is PSPACE-Complete
Bohm, Stanislav
Goller, Stefan
Jancar, Petr
CONCUR 2010 - CONCURRENCY THEORY, 2010, 6269 : 177 - +
[46] Parameterized Verification under Release Acquire is PSPACE-complete
Krishna, Shankaranarayanan
Godbole, Adwait
Meyer, Roland
Chakraborty, Soham
PROCEEDINGS OF THE 2022 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, PODC 2022, 2022, : 482 - 492
[47] The Cyclic-Routing UAV Problem is PSPACE-Complete
Ho, Hsi-Ming
Ouaknine, Joel
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2015), 2015, 9034 : 328 - 342
[48] Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)
Geffert, Viliam
COMPUTER SCIENCE - THEORY AND APPLICATIONS (CSR 2017), 2017, 10304 : 141 - 153
[49] PSPACE-complete two-color planar placement games
Burke, Kyle
Hearn, Robert A.
INTERNATIONAL JOURNAL OF GAME THEORY, 2019, 48 (02) : 393 - 410
[50] Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
Grier, Daniel
AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 497 - 503

← 1 2 3 4 5 →