Herugolf and Makaro are NP-complete
Iwamoto, Chuzo, Masato Haruishi, Tatsuaki Ibusuki · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2018
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.