BLOCKSUM is NP-Complete

被引：7
|
作者：
Haraguchi, Kazuya [1 ]
Ono, Hirotaka [2 ]
机构：
[1] Ishinomaki Senshu Univ, Fac Sci & Engn, Dept Informat Technol & Elect, Ishinomaki, Miyagi 9868580, Japan
[2] Kyushu Univ, Fac Econ, Dept Econ Engn, Fukuoka 8128581, Japan
来源：
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2013年 / E96D卷 / 03期
关键词：
NP-completeness; combinatorial puzzle; Latin square; BLOCKSUM;
D O I：
10.1587/transinf.E96.D.481
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
BLOCKSUM, also known as KEISANBLOCK in Japanese, is a Latin square filling type puzzle, such as Sudoku. In this paper, we prove that the decision problem whether a given instance of BLOCKSUM has a solution or not is NP-complete.
引用
收藏
页码：481 / 488
页数：8
相关论文
共 50 条
  • [1] Minesweeper is NP-complete
    Richard Kaye
    The Mathematical Intelligencer, 2000, 22 : 9 - 15
  • [2] Hashiwokakero is NP-complete
    Andersson, Daniel
    INFORMATION PROCESSING LETTERS, 2009, 109 (19) : 1145 - 1146
  • [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] Tipover is NP-complete
    Robert A. Hearn
    The Mathematical Intelligencer, 2006, 28 : 10 - 14
  • [7] HIROIMONO is NP-Complete
    Andersson, Daniel
    Fun with Algorithms, Proceedings, 2007, 4475 : 30 - 39
  • [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