论文信息 - 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 if #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.

Erik D. Demaine | Yoshio Okamoto | Ryuhei Uehara | Yushi Uno

[1] Martin J. Chlond. Classroom Exercises in IP Modeling: Su Doku and the Log Pile , 2005 .

[2] Dick den Hertog,et al. Puzzle - Solving the Battleship Puzzle as an Integer Programming Problem , 2010, INFORMS Trans. Educ..

[3] Samuel Y. Edgerton. Painting by numbers , 1997, Nature.

[4] Tobias Achterberg,et al. SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

[5] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[6] Richard Hamilton,et al. Painting by Numbers , 2007 .

[7] Nadia Creignou,et al. Complexity of Generalized Satisfiability Counting Problems , 1996, Inf. Comput..

[8] U. Dulleck,et al. μ-σ Games , 2012, Games.

[9] Francisco Azevedo,et al. Colored Nonograms: An Integer Linear Programming Approach , 2009, EPIA.

[10] Timothy D. Rankin,et al. An Integer Programming Model for the Sudoku Problem , 2007 .