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 Herugolf and Makaro
Chuzo IWAMOTO, Masato HARUISHI, Tatsuaki IBUSUKI
Author information
Keywords: Herugolf, Makaro, pencil puzzle, NP-complete
JOURNAL RESTRICTED ACCESS

2019 Volume E102.A Issue 9 Pages 1118-1125

Details
Download PDF (1442K)
Download citation RIS

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

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract

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

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