IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Discrete Mathematics and Its Applications
Computational Complexity of Nurimisaki and Sashigane
Chuzo IWAMOTO, Tatsuya IDE
Author information
Keywords: Nurimisaki, Sashigane, pencil puzzle, NP-complete
JOURNAL RESTRICTED ACCESS

2020 Volume E103.A Issue 10 Pages 1183-1192

Details
Download PDF (2321K)
Download citation RIS

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

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract

Nurimisaki and Sashigane are Nikoli's pencil puzzles. We study the computational complexity of Nurimisaki and Sashigane puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.

Content from these authors
© 2020 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