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 条
  • [1] Lemmings is PSPACE-complete
    Viglietta, Giovanni
    THEORETICAL COMPUTER SCIENCE, 2015, 586 : 120 - 134
  • [2] Lemmings Is PSPACE-Complete
    Viglietta, Giovanni
    FUN WITH ALGORITHMS, 2014, 8496 : 340 - 351
  • [3] Generalized Amazons is PSPACE-Complete
    Furtak, Timothy
    Kiyomi, Masashi
    Uno, Takeaki
    Buro, Michael
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 132 - 137
  • [4] Robustness of PSPACE-complete sets
    Pavan, A.
    Wang, Fengming
    INFORMATION PROCESSING LETTERS, 2007, 103 (03) : 102 - 104
  • [5] Havannah and TwixT are PSPACE-complete
    Bonnet, Edouard
    Jamain, Florian
    Saffidine, Abdallah
    COMPUTERS AND GAMES, CG 2013, 2014, 8427 : 175 - 186
  • [6] Avoidance games are PSPACE-Complete
    Gledel, Valentin
    Oijid, Nacim
    arXiv, 2022,
  • [7] PULL and PUSHPULL are PSPACE-complete
    Pereira, Andre G.
    Ritt, Marcus
    Buriol, Luciana S.
    THEORETICAL COMPUTER SCIENCE, 2016, 628 : 50 - 61
  • [8] Integer circuit evaluation is PSPACE-complete
    Yang, K
    15TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 204 - 211
  • [9] DAG-width is PSPACE-complete
    Amiri, Saeed Akhoondian
    Kreutzer, Stephan
    Rabinovich, Roman
    THEORETICAL COMPUTER SCIENCE, 2016, 655 : 78 - 89
  • [10] Generalized Chat Noir is PSPACE-Complete
    Iwamoto, Chuzo
    Mukai, Yuta
    Sumida, Yuichi
    Morita, Kenichi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (03) : 502 - 505
12345