IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Discrete Mathematics and Its Applications
Computational Complexity and an Integer Programming Model of Shakashaka
Erik D. DEMAINEYoshio OKAMOTORyuhei UEHARAYushi UNO
Author information
JOURNALS RESTRICTED ACCESS

2014 Volume E97.A Issue 6 Pages 1213-1219

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

Information related to the author
© 2014 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top