Herugolf and Makaro are NP-complete
| Autor: | Iwamoto, Chuzo, Haruishi, Masato, Ibusuki, Tatsuaki |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: | |
| DOI: | 10.4230/lipics.fun.2018.24 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|