Nondango is NP-Complete
Computational Complexity
2024-02-27 v2
Abstract
Nondango is a pencil puzzle consisting of a rectangular grid partitioned into regions, with some cells containing a white circle. The player has to color some circles black such that every region contains exactly one black circle, and there are no three consecutive circles (horizontally, vertically, or diagonally) having the same color. In this paper, we prove that deciding solvability of a given Nondango puzzle is NP-complete.
Cite
@article{arxiv.2310.11447,
title = {Nondango is NP-Complete},
author = {Suthee Ruangwises},
journal= {arXiv preprint arXiv:2310.11447},
year = {2024}
}