Computational Complexity of Usowan Puzzles

Chuzo IWAMOTO; Masato HARUISHI

doi:10.1587/transfun.E101.A.1537

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 Usowan Puzzles

Chuzo IWAMOTO, Masato HARUISHI

Author information

Keywords: Usowan, pencil puzzle, NP-complete

JOURNAL RESTRICTED ACCESS

2018 Volume E101.A Issue 9 Pages 1537-1540

DOI https://doi.org/10.1587/transfun.E101.A.1537

Details

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.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!