Computational Complexity and an Integer Programming Model of Shakashaka
Name
Demaine_Computational complexity.pdf
Size
305.64 KB
Format
Adobe PDF
Checksum (MD5)
e6f130b18846bb31f54187b5c3c88427
Author(s)
Demaine, Erik D.
Okamoto, Yoshio
Uehara, Ryuhei
Uno, Yushi
Date Issued
June 2014
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
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1587/transfun.E97.A.1213
