Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FUN.2018.24
URN: urn:nbn:de:0030-drops-88159
URL: https://drops.dagstuhl.de/opus/volltexte/2018/8815/
Iwamoto, Chuzo ; Haruishi, Masato ; Ibusuki, Tatsuaki
Herugolf and Makaro are NP-complete
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{iwamoto_et_al:LIPIcs:2018:8815,
author = {Chuzo Iwamoto and Masato Haruishi and Tatsuaki Ibusuki},
title = {{Herugolf and Makaro are NP-complete}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {24:1--24:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Hiro Ito and Stefano Leonardi and Linda Pagli and Giuseppe Prencipe},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8815},
URN = {urn:nbn:de:0030-drops-88159},
doi = {10.4230/LIPIcs.FUN.2018.24},
annote = {Keywords: Herugolf, Makaro, pencil puzzle, NP-complete}
}
| Keywords: | Herugolf, Makaro, pencil puzzle, NP-complete | |
| Seminar: | 9th International Conference on Fun with Algorithms (FUN 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 04.06.2018 |
