The fewest clues problem

The fewest clues problem

Show other versions (1)

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 assum...

Full description

Bibliographic Details
Main Authors: Fermi, Ma, Schvartzman, Ariel, Waingarten, Erik, Demaine, Erik D, Aaronson, Scott
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik 2017
Online Access:http://hdl.handle.net/1721.1/112925
https://orcid.org/0000-0003-3803-5703
https://orcid.org/0000-0003-1333-4045

Internet

http://hdl.handle.net/1721.1/112925
https://orcid.org/0000-0003-3803-5703
https://orcid.org/0000-0003-1333-4045

Similar Items