Computational Complexity and an Integer Programming Model of Shakashaka

Computational Complexity and an Integer Programming Model of Shakashaka

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

Full description

Bibliographic Details
Main Authors: Demaine, Erik D., Okamoto, Yoshio, Uehara, Ryuhei, Uno, Yushi
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Institute of Electronics, Information and Communications Engineers 2015
Online Access:http://hdl.handle.net/1721.1/99994
https://orcid.org/0000-0003-3803-5703

Similar Items

Similar Items