HIROIMONO is NP-Complete

被引:0
|
作者
Andersson, Daniel [1 ]
机构
[1] Aarhus Univ, Dept Comp Sci, DK-8000 Aarhus C, Denmark
来源
关键词
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 条
  • [41] An NP-complete fragment of LTL
    Muscholl, A
    Walukiewicz, I
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2005, 16 (04) : 743 - 753
  • [42] Autoreducibility of NP-Complete Sets
    Hitchcock, John M.
    Shafei, Hadi
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [43] Elastic image matching is NP-complete
    Keysers, D
    Unger, W
    PATTERN RECOGNITION LETTERS, 2003, 24 (1-3) : 445 - 453
  • [44] Theory-contraction is NP-complete
    Tennant, Neil
    LOGIC JOURNAL OF THE IGPL, 2003, 11 (06) : 675 - 693
  • [45] Border Basis Detection is NP-complete
    Ananth, Prabhanjan V.
    Dukkipati, Ambedkar
    ISSAC 2011: PROCEEDINGS OF THE 36TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, 2011, : 11 - 18
  • [46] A simplified NP-complete MAXSAT problem
    Raman, V
    Ravikumar, B
    Rao, SS
    INFORMATION PROCESSING LETTERS, 1998, 65 (01) : 1 - 6
  • [47] Universal solutions for NP-complete problems
    Portier, N
    THEORETICAL COMPUTER SCIENCE, 1998, 201 (1-2) : 137 - 150
  • [48] MaxCut on permutation graphs is NP-complete
    de Figueiredo, Celina M. H.
    de Melo, Alexsander A.
    Oliveira, Fabiano S.
    Silva, Ana
    JOURNAL OF GRAPH THEORY, 2023, 104 (01) : 5 - 16
  • [49] Recognition of Collapsible Complexes is NP-Complete
    Martin Tancer
    Discrete & Computational Geometry, 2016, 55 : 21 - 38
  • [50] Via minimization problem is NP-complete
    Naclerio, Nicholas J., 1604, (38):