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.
No takes yet. Share an insight, caveat, or question.
Jonas K ouml lker (2012) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: