共 50 条
Five Cells and Tilepaint are NP-Complete
被引:5
|作者:
Iwamoto, Chuzo
[1
]
Ide, Tatsuya
[1
]
机构:
[1] Hiroshima Univ, Grad Sch Adv Sci & Engn, Higashihiroshima 7398527, Japan
关键词:
Five Cells;
Tilepaint;
pencil puzzle;
NP-complete;
COMPUTATIONAL-COMPLEXITY;
D O I:
10.1587/transinf.2021FCP0001
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
Five Cells and Tilepaint are Nikoli's pencil puzzles. We study the computational complexity of Five Cells and Tilepaint puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.
引用
收藏
页码:508 / 516
页数:9
相关论文