Herugolf and Makaro are NP-complete

Herugolf and Makaro are Nikoli\u27s 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

さとがえりパズルの効率的な解法に関する研究

Tohoku University篠原