Herugolf and Makaro are NP-complete

Herugolf and Makaro are Nikoli's pencil puzzles. We study the computational complexity of Herugolf and Makaro puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.

[1]  Bruce A. Reed,et al.  Partition into cliques for cubic graphs: Planar case, complexity and approximation , 2008, Discret. Appl. Math..

[2]  Hiroaki Suzuki,et al.  Fillmat is NP-Complete and ASP-Complete , 2015, J. Inf. Process..

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Erik D. Demaine,et al.  Games, puzzles and computation , 2009 .

[5]  Daniel Andersson.  Hashiwokakero is NP-complete , 2009, Inf. Process. Lett..

[6]  Blair D. Sullivan,et al.  Zig-Zag Numberlink is NP-Complete , 2014, J. Inf. Process..

[7]  Hiroaki Suzuki,et al.  The Complexity of Generalized Pipe Link Puzzles , 2017, J. Inf. Process..

[8]  Erik D. Demaine,et al.  Computational complexity and an integer programming model of Shakashaka , 2013, CCCG.

[9]  Shohei Kanehiro,et al.  Satogaeri, Hebi, and Suraromu Are NP-Complete , 2015, 2015 3rd International Conference on Applied Computing and Information Technology/2nd International Conference on Computational Science and Intelligence.

[10]  Chuzo Iwamoto.  Yosenabe is NP-complete , 2014, J. Inf. Process..