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