HIROIMONO is NP-Complete

被引：0
|
作者：
Andersson, Daniel [1 ]
机构：
[1] Aarhus Univ, Dept Comp Sci, DK-8000 Aarhus C, Denmark
来源：
Fun with Algorithms, Proceedings | 2007年 / 4475卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In a Hiroimono puzzle, one must collect a set of stones from a square grid, moving along grid lines, picking up stones as one encounters them, and changing direction only when one picks up a stone. We show that deciding the solvability of such puzzles is NP-complete.
引用
收藏
页码：30 / 39
页数：10
相关论文
共 50 条
  • [31] Splitting NP-complete sets
    Glasser, Christian
    Pavan, A.
    Selman, Alan L.
    Zhang, Liyu
    SIAM JOURNAL ON COMPUTING, 2008, 37 (05) : 1517 - 1535
  • [32] AN NP-COMPLETE MATCHING PROBLEM
    PLAISTED, DA
    ZAKS, S
    DISCRETE APPLIED MATHEMATICS, 1980, 2 (01) : 65 - 72
  • [33] Choco Banana is NP-Complete∗
    Iwamoto, Chuzo
    Tokunaga, Takeru
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2024, E107A (09) : 1488 - 1491
  • [34] Splitting number is NP-complete
    Faria, L
    de Figueiredo, CMH
    Mendonça, CFX
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1998, 1517 : 285 - 297
  • [35] System BV is NP-complete
    Kahramanogullari, Ozan
    ANNALS OF PURE AND APPLIED LOGIC, 2008, 152 (1-3) : 107 - 121
  • [36] The STO problem is NP-complete
    Krysta, P
    Pacholski, L
    JOURNAL OF SYMBOLIC COMPUTATION, 1999, 27 (02) : 207 - 219
  • [37] TENSOR RANK IS NP-COMPLETE
    HASTAD, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 372 : 451 - 460
  • [38] Decidability of NP-Complete Problems
    Vagis, A. A.
    Gupal, A. M.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2022, 58 (06) : 914 - 916
  • [39] Lambek calculus is NP-complete
    Pentus, Mati
    THEORETICAL COMPUTER SCIENCE, 2006, 357 (1-3) : 186 - 201
  • [40] Hamiltonian index is NP-complete
    Ryjacek, Zdenek
    Woeginger, Gerhard J.
    Xiong, Liming
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (04) : 246 - 250
12345