J-STAGE Home  >  Publications - Top  > Bibliographic Information

Journal of Information Processing
Vol. 20 (2012) No. 3 pp. 694-706



In a Kurodoko puzzle, one must colour some squares in a grid black in a way that satisfies non-overlapping, non-adjacency, reachability and numeric constraints specified by the numeric clues in the grid. We show that deciding the solvability of Kurodoko puzzles is NP-complete.

Copyright © 2012 by the Information Processing Society of Japan

Article Tools

Share this Article