Computational Complexity and an Integer Programming Model of Shakashaka

Author(s)
Demaine, Erik D.; Okamoto, Yoshio; Uehara, Ryuhei; Uno, Yushi
Thumbnail
DownloadDemaine_Computational complexity.pdf (305.6Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
Shakashaka is a pencil-and-paper puzzle proposed by Guten and popularized by the Japanese publisher Nikoli (like Sudoku). We determine the computational complexity by proving that Shakashaka is NP-complete, and furthermore that counting the number of solutions is #P-complete. Next we formulate Shakashaka as an integer-programming (IP) problem, and show that an IP solver can solve every instance from Nikoli's website within a second.
Date issued
2014-06
URI
http://hdl.handle.net/1721.1/99994
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Publisher
Institute of Electronics, Information and Communications Engineers
Citation
Demaine, Erik D., Yoshio Okamoto, Ryuhei Uehara, and Yushi Uno. “Computational Complexity and an Integer Programming Model of Shakashaka.” IEICE Trans. Fundamentals E97.A, no. 6 (2014): 1213–1219.
Version: Author's final manuscript
ISSN
0916-8508
1745-1337
Collections