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 条
  • [1] Hashiwokakero is NP-complete
    Andersson, Daniel
    INFORMATION PROCESSING LETTERS, 2009, 109 (19) : 1145 - 1146
  • [2] Minesweeper is NP-complete
    Richard Kaye
    The Mathematical Intelligencer, 2000, 22 : 9 - 15
  • [3] Shellability is NP-complete
    Goaoc, Xavier
    Patak, Pavel
    Patakova, Zuzana
    Tancer, Martin
    Wagner, Uli
    JOURNAL OF THE ACM, 2019, 66 (03)
  • [4] Rikudo is NP-complete
    Viet-Ha Nguyen
    Perrot, Kevin
    THEORETICAL COMPUTER SCIENCE, 2022, 910 : 34 - 47
  • [5] Minesweeper is NP-complete
    Kaye, R
    MATHEMATICAL INTELLIGENCER, 2000, 22 (02): : 9 - 15
  • [6] BLOCKSUM is NP-Complete
    Haraguchi, Kazuya
    Ono, Hirotaka
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (03) : 481 - 488
  • [7] Tipover is NP-complete
    Robert A. Hearn
    The Mathematical Intelligencer, 2006, 28 : 10 - 14
  • [8] TETRAVEX is NP-complete
    Takenaga, Yasuhiko
    Walsh, Toby
    INFORMATION PROCESSING LETTERS, 2006, 99 (05) : 171 - 174
  • [9] TipOver is NP-complete
    Hearn, Robert A.
    MATHEMATICAL INTELLIGENCER, 2006, 28 (03): : 10 - 14
  • [10] BoxOff is NP-Complete
    Hayward, Ryan
    Hearn, Robert
    Jamshidian, Mahya
    ADVANCES IN COMPUTER GAMES, ACG 2021, 2022, 13262 : 118 - 127
12345