C Iwamoto, T Ide - IEICE TRANSACTIONS on Information and …, 2022 - search.ieice.org
Five Cells and Tilepaint are NP-Complete Page 1 508 IEICE TRANS. INF. & SYST., VOL.E105–D, NO.3 MARCH 2022 PAPER Special Section on Foundations of Computer Science - New …
ED Demaine, J Lynch, M Rudoy, Y Uno - arXiv preprint arXiv:2106.15585, 2021 - arxiv.org
We prove NP-completeness of Yin-Yang/Shiromaru-Kuromaru pencil-and-paper puzzles. Viewed as a graph partitioning problem, we prove NP-completeness of partitioning a …
C Iwamoto, T Ibusuki - IEICE TRANSACTIONS on Information and …, 2020 - search.ieice.org
Polynomial-Time Reductions from 3SAT to Kurotto and Juosan Puzzles Page 1 500 IEICE TRANS. INF. & SYST., VOL.E103–D, NO.3 MARCH 2020 PAPER Special Section on …
S Ruangwises - arXiv preprint arXiv:2310.11447, 2023 - arxiv.org
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 …