dc.contributor.author | Demaine, Erik D. | |
dc.contributor.author | Okamoto, Yoshio | |
dc.contributor.author | Uehara, Ryuhei | |
dc.contributor.author | Uno, Yushi | |
dc.date.accessioned | 2015-11-23T15:48:55Z | |
dc.date.available | 2015-11-23T15:48:55Z | |
dc.date.issued | 2014-06 | |
dc.identifier.issn | 0916-8508 | |
dc.identifier.issn | 1745-1337 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/99994 | |
dc.description.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. | en_US |
dc.language.iso | en_US | |
dc.publisher | Institute of Electronics, Information and Communications Engineers | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1587/transfun.E97.A.1213 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | Computational Complexity and an Integer Programming Model of Shakashaka | en_US |
dc.type | Article | en_US |
dc.identifier.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. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.mitauthor | Demaine, Erik D. | en_US |
dc.relation.journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dspace.orderedauthors | Demaine, Erik D.; Okamoto, Yoshio; Uehara, Ryuhei; Uno, Yushi | en_US |
dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |