Special Section on Discrete Mathematics and Its Applications
Computational Complexity of Herugolf and Makaro
2019 年 E102.A 巻 9 号 p. 1118-1125
詳細
2019 年 E102.A 巻 9 号 p. 1118-1125
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.
