Abstract
Kurotto and Juosan are Nikoli’s pencil puzzles. We study the computational complexity of Kurotto and Juosan puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete. Each of the two proofs uses a reduction from the PLANAR 3SAT problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
WEB Nikoli. http://nikoli.co.jp/en/puzzles/kurotto.html
WEB Nikoli. http://nikoli.co.jp/en/puzzles/juosan.html
Adcock, A.B., et al.: Zig-zag numberlink is NP-complete. J. Inf. Process. 23(3), 239–245 (2015). https://doi.org/10.2197/ipsjjip.23.239
Andersson, D.: Hashiwokakero is NP-complete. Inf. Process. Lett. 109, 1145–1146 (2009). https://doi.org/10.1016/j.ipl.2009.07.017
Demaine, E.D., Okamoto, Y., Uehara, R., Uno, Y.: Computational complexity and an integer programming model of Shakashaka. IEICE Trans. Fund. Electr. E97A(6), 1213–1219 (2014). https://doi.org/10.1587/transfun.E97.A.1213
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. A K Peters Ltd. (2009)
Ishibashi, A., Sato, Y., Iwata, S.: NP-completeness of two pencil puzzles: Yajilin and Country Road. Utilitas Mathematica 88, 237–246 (2012)
Iwamoto, C.: Yosenabe is NP-complete. J. Inf. Process. 22(1), 40–43 (2014). https://doi.org/10.2197/ipsjjip.22.40
Iwamoto, C., Haruishi, M.: Computational complexity of Usowan puzzles. IEICE Trans. Fund. Electr. D101-A(9) (2018). https://doi.org/10.1587/transfun.E101.A.1537
Iwamoto, C., Haruishi, M., Ibusuki, T.: Herugolf and Makaro are NP-complete. In: 9th International Conference on Fun with Algorithms. LIPICS, La Maddalena, Italy, 13–15 June 2018, vol. 100, pp. 23:1–23:11 (2018). https://doi.org/10.4230/LIPIcs.FUN.2018.23
Iwamoto, C., Ibusuki, T.: Dosun-Fuwari is NP-complete. J. Inf. Process. 26, 358–361 (2018). https://doi.org/10.2197/ipsjjip.26.358
Kölker, J.: Kurodoko is NP-complete. J. Inf. Process. 20(3), 694–706 (2012). https://doi.org/10.2197/ipsjjip.20.694
Takenaga, Y., Aoyagi, S., Iwata, S., Kasai, T.: Shikaku and Ripple effect are NP-complete. Congr. Numer. 216, 119–127 (2013)
Uejima, A., Suzuki, H.: Fillmat is NP-complete and ASP-complete. J. Inf. Process. 23(3), 310–316 (2015). https://doi.org/10.2197/ipsjjip.23.310
Uejima, A., Suzuki, H., Okada, A.: The complexity of generalized pipe link puzzles. J. Inf. Process. 25, 724–729 (2017). https://doi.org/10.2197/ipsjjip.25.724
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Iwamoto, C., Ibusuki, T. (2021). Computational Complexity of Two Pencil Puzzles: Kurotto and Juosan. In: Akiyama, J., Marcelo, R.M., Ruiz, MJ.P., Uno, Y. (eds) Discrete and Computational Geometry, Graphs, and Games. JCDCGGG 2018. Lecture Notes in Computer Science(), vol 13034. Springer, Cham. https://doi.org/10.1007/978-3-030-90048-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-90048-9_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-90047-2
Online ISBN: 978-3-030-90048-9
eBook Packages: Computer ScienceComputer Science (R0)