IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Special Section on Foundations of Computer Science- Frontiers of Theory of Computation and Algorithm -
Polynomial-Time Reductions from 3SAT to Kurotto and Juosan Puzzles
Chuzo IWAMOTO, Tatsuaki IBUSUKI
Author information
Keywords: Kurotto, Juosan, pencil puzzle, NP-complete
JOURNAL FREE ACCESS

2020 Volume E103.D Issue 3 Pages 500-505

Details
Download PDF (789K)
Download citation RIS

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

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract

Kurotto and Juosan are Nikoli's pencil puzzles. We study the computational complexity of Kurotto and Juosan 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