BlockSum is NP-Complete

BlockSum is NP-Complete

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Information and Systems 2013/03/01, Vol.E96.D(3), pp.481-488
Hauptverfasser: HARAGUCHI, Kazuya, ONO, Hirotaka
Format: Artikel
Sprache:eng
Schlagworte:
BlockSum
combinatorial puzzle
Latin square
NP-completeness
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0916-8532
1745-1361
DOI:10.1587/transinf.E96.D.481