IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Special Section on Foundations of Computer Science — Foundations of Computer Science and their New Trends —
Chained Block is NP-Complete
Chuzo IWAMOTO, Tatsuya IDE
Author information
Keywords: chained Block, pencil puzzle, NP-complete
JOURNAL FREE ACCESS

2024 Volume E107.D Issue 3 Pages 320-324

Details
Download PDF (279K)
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract

Chained Block is one of Nikoli's pencil puzzles. We study the computational complexity of Chained Block puzzles. It is shown that deciding whether a given instance of the Chained Block puzzle has a solution is NP-complete.

Content from these authors
© 2024 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
Favorites & Alerts

Recently viewed articles
Announcements from publisher
Share this page
feedback
 Top