2000 character limit reached
Nondango is NP-Complete (2310.11447v2)
Published 17 Oct 2023 in cs.CC
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.
- A. Allen and A. Williams. Sto-Stone is NP-Complete. In Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG), pp. 28–34 (2018).
- D. Andersson. Hashiwokakero is NP-complete. Information Processing Letters, 109(9): 1145–1146 (2009).
- D. Andersson. HIROIMONO Is NP-Complete. In Proceedings of the 4th International Conference on Fun with Algorithms (FUN), pp. 30–39 (2007).
- M. Biro and C. Schmidt. Computational complexity and bounds for Norinori and LITS. In Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG), pp. 29–32 (2017).
- M. Holzer and O. Ruepp. The Troubles of Interior Design–A Complexity Analysis of the Game Heyawake. In Proceedings of the 4th International Conference on Fun with Algorithms (FUN), pp. 198–212 (2007).
- C. Iwamoto. Yosenabe is NP-complete. Journal of Information Processing, 22(1): 40–43 (2014).
- C. Iwamoto and M. Haruishi. Computational Complexity of Usowan Puzzles. IEICE Trans. Fundamentals, 101.A(9): 1537–1540 (2018).
- C. Iwamoto and T. Ibusuki. Dosun-Fuwari is NP-complete. Journal of Information Processing, 26: 358–361 (2018).
- C. Iwamoto and T. Ibusuki. Polynomial-Time Reductions from 3SAT to Kurotto and Juosan Puzzles. IEICE Trans. Inf. & Syst., 103.D(3): 500–505 (2020).
- C. Iwamoto and T. Ide. Computational Complexity of Nurimisaki and Sashigane. IEICE Trans. Fundamentals, 103.A(10): 1183–1192 (2020).
- C. Iwamoto and T. Ide. Five Cells and Tilepaint are NP-Complete. IEICE Trans. Inf. & Syst., 105.D(3): 508–516 (2022).
- A. Janko and O. Janko. Nondango. https://www.janko.at/Raetsel/Nondango/index.htm
- J. Kölker. Kurodoko is NP-Complete. Journal of Information Processing, 20(3): 694–706 (2012).
- W. Mulzer and G. Rote. Minimum-weight triangulation is NP-hard. Journal of the ACM, 55(2): 11:1–11:29 (2008).
- S. Ruangwises. Sumplete is Hard, Even with Two Different Numbers. arXiv:2309.07161 (2023). https://arxiv.org/abs/2309.07161
- T.J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC), pp. 216–226 (1978).
- A. Uejima and H. Suzuki. Fillmat is NP-Complete and ASP-Complete. Journal of Information Processing, 23(3): 310–316 (2015).
- T. Yato and T. Seta. Complexity and Completeness of Finding Another Solution and Its Application to Puzzles. IEICE Trans. Fundamentals, 86.A(5): 1052–1060 (2003).