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 条
  • [21] Properties of NP-complete sets
    Glasser, C
    Pavan, A
    Selman, AL
    Sengupta, S
    19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 184 - 197
  • [22] CROSSING NUMBER IS NP-COMPLETE
    GAREY, MR
    JOHNSON, DS
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (03): : 312 - 316
  • [23] Entropy for NP-complete problems
    Levchenkov, V.S.
    Doklady Akademii Nauk, 2001, 376 (02) : 175 - 178
  • [24] Chained Block is NP-Complete
    Iwamoto, Chuzo
    Ide, Tatsuya
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2024, E107D (03) : 320 - 324
  • [25] The entropy of NP-complete problems
    Levchenkov, VS
    DOKLADY MATHEMATICS, 2001, 63 (01) : 130 - 132
  • [26] SPLITTING NUMBER is NP-complete
    Faria, L
    de Figueiredo, CMH
    Mendonça, CFX
    DISCRETE APPLIED MATHEMATICS, 2001, 108 (1-2) : 65 - 83
  • [27] Strategic Argumentation is NP-Complete
    Governatori, G.
    Olivieri, F.
    Scannapieco, S.
    Rotolo, A.
    Cristani, M.
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 399 - 404
  • [28] Decidability of NP-Complete Problems
    A. A. Vagis
    A. M. Gupal
    Cybernetics and Systems Analysis, 2022, 58 : 914 - 916
  • [29] ON ONE NP-COMPLETE PROBLEM
    DEMEL, J
    DEMLOVA, M
    KYBERNETIKA, 1995, 31 (02) : 207 - 211
  • [30] System BV is NP-complete
    Kahramanogullari, Ozan
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 143 : 87 - 99
12345