Five Cells and Tilepaint are NP-Complete

Five Cells and Tilepaint are NP-Complete

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Information and Systems 2022/03/01, Vol.E105.D(3), pp.508-516
Hauptverfasser: IWAMOTO, Chuzo, IDE, Tatsuya
Format: Artikel
Sprache:eng
Schlagworte:
Five Cells
NP-complete
pencil puzzle
Tilepaint
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0916-8532
1745-1361
DOI:10.1587/transinf.2021FCP0001