The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Herugolf e Makaro são os quebra-cabeças de lápis de Nikoli. Estudamos a complexidade computacional dos quebra-cabeças Herugolf e Makaro. É mostrado que decidir se uma determinada instância de cada quebra-cabeça tem uma solução é NP-completo.
Chuzo IWAMOTO
Hiroshima University
Masato HARUISHI
Hiroshima University
Tatsuaki IBUSUKI
Hiroshima University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Chuzo IWAMOTO, Masato HARUISHI, Tatsuaki IBUSUKI, "Computational Complexity of Herugolf and Makaro" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 9, pp. 1118-1125, September 2019, doi: 10.1587/transfun.E102.A.1118.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.1118/_p
Copiar
@ARTICLE{e102-a_9_1118,
author={Chuzo IWAMOTO, Masato HARUISHI, Tatsuaki IBUSUKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Computational Complexity of Herugolf and Makaro},
year={2019},
volume={E102-A},
number={9},
pages={1118-1125},
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.},
keywords={},
doi={10.1587/transfun.E102.A.1118},
ISSN={1745-1337},
month={September},}
Copiar
TY - JOUR
TI - Computational Complexity of Herugolf and Makaro
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1118
EP - 1125
AU - Chuzo IWAMOTO
AU - Masato HARUISHI
AU - Tatsuaki IBUSUKI
PY - 2019
DO - 10.1587/transfun.E102.A.1118
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2019
AB - 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.
ER -