IEICE TRANSACTIONS on Fundamentals
Computational Complexity of Usowan Puzzles
Summary :
Usowan is one of Nikoli's pencil puzzles. We study the computational complexity of Usowan puzzles. It is shown that deciding whether a given instance of the Usowan puzzle has a solution is NP-complete.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.9 pp.1537-1540
- Publication Date
- 2018/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E101.A.1537
- Type of Manuscript
- Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Chuzo IWAMOTO
Hiroshima University
Masato HARUISHI
Hiroshima University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Chuzo IWAMOTO, Masato HARUISHI, "Computational Complexity of Usowan Puzzles" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 9, pp. 1537-1540, September 2018, doi: 10.1587/transfun.E101.A.1537.
Abstract: Usowan is one of Nikoli's pencil puzzles. We study the computational complexity of Usowan puzzles. It is shown that deciding whether a given instance of the Usowan puzzle has a solution is NP-complete.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.1537/_p
Copy
@ARTICLE{e101-a_9_1537,
author={Chuzo IWAMOTO, Masato HARUISHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Computational Complexity of Usowan Puzzles},
year={2018},
volume={E101-A},
number={9},
pages={1537-1540},
abstract={Usowan is one of Nikoli's pencil puzzles. We study the computational complexity of Usowan puzzles. It is shown that deciding whether a given instance of the Usowan puzzle has a solution is NP-complete.},
keywords={},
doi={10.1587/transfun.E101.A.1537},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Computational Complexity of Usowan Puzzles
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1537
EP - 1540
AU - Chuzo IWAMOTO
AU - Masato HARUISHI
PY - 2018
DO - 10.1587/transfun.E101.A.1537
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2018
AB - Usowan is one of Nikoli's pencil puzzles. We study the computational complexity of Usowan puzzles. It is shown that deciding whether a given instance of the Usowan puzzle has a solution is NP-complete.
ER -
English
