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 条
  • [31] An Automaton Group with PSPACE-Complete Word Problem
    Jan Philipp Wächter
    Armin Weiß
    Theory of Computing Systems, 2023, 67 : 178 - 218
  • [32] FINITE-AUTOMATON APERIODICITY IS PSPACE-COMPLETE
    CHO, S
    HUYNH, DT
    THEORETICAL COMPUTER SCIENCE, 1991, 88 (01) : 99 - 116
  • [33] An Automaton Group with PSPACE-Complete Word Problem
    Waechter, Jan Philipp
    Weiss, Armin
    THEORY OF COMPUTING SYSTEMS, 2023, 67 (01) : 178 - 218
  • [34] Solving a PSPACE-complete problem by gene assembly
    Zerjatke, Thomas
    Sturm, Monika
    JOURNAL OF LOGIC AND COMPUTATION, 2013, 23 (04) : 897 - 908
  • [35] An Automaton Group with PSPACE-Complete Word Problem
    Waechter, Jan Philipp
    Weiss, Armin
    37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
  • [36] Nondeterministic information logic NIL is PSPACE-complete
    Demri, Stephane
    Fundamenta Informaticae, 2000, 42 (03) : 211 - 234
  • [37] Bounded-width QBF is PSPACE-complete
    Atserias, Albert
    Oliva, Sergi
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2014, 80 (07) : 1415 - 1429
  • [38] Generalized Pete's Pike is PSPACE-complete
    Meyer, Bernd
    THEORETICAL COMPUTER SCIENCE, 2016, 613 : 115 - 125
  • [39] Parameterized Verification under TSO is PSPACE-Complete
    Abdulla, Parosh Aziz
    Atig, Mohamed Faouzi
    Rezvan, Rojin
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2020, 4 (POPL):
  • [40] Universal Generation for Optimality Theory Is PSPACE-Complete
    Hao, Sophie
    COMPUTATIONAL LINGUISTICS, 2023, 50 (01) : 83 - 117
12345