The fewest clues problem
When analyzing the computational complexity of well-known puzzles, most papers consider the algorithmic challenge of solving a given instance of (a generalized form of) the puzzle. We take a different approach by analyzing the computational complexity of designing a “good” puzzle. We assume a puzzle...
| Autori principali: | , , , , |
|---|---|
| Altri autori: | |
| Natura: | Articolo |
| Lingua: | English |
| Pubblicazione: |
Elsevier BV
2020
|
| Accesso online: | https://hdl.handle.net/1721.1/123865 |