Journal of Information Processing
Online ISSN : 1882-6652
Kurodoko is NP-Complete
Jonas Kölker
Author information
JOURNALS FREE ACCESS

2012 Volume 20 Issue 3 Pages 694-706

Details
Abstract

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.

Information related to the author
© 2012 by the Information Processing Society of Japan
Previous article Next article
feedback
Top