JAIST Repository >
School of Information Science >
Conference Papers >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/11619

Title: Computational complexity and an integer programming model of Shakashaka
Authors: Demaine, Erik D.
Okamoto, Yoshio
Uehara, Ryuhei
Uno, Yushi
Keywords: integer programming
NP-completeness
pencil-and-paper puzzle
Shakashaka
Issue Date: 2013-08
Publisher: CCCG
Magazine name: Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013)
Start page: 31
End page: 36
Abstract: Shakashaka, one of the so-called “pencil-and-paper”puzzles like Sudoku, was proposed by Guten and hasbeen popularized by the Japanese publisher Nikoli. The computational complexity of Shakashaka was not studied so far. We first prove that Shakashaka is NPcomplete. Next we formulate Shakashaka as an integer programming problem. We apply the formulation to some concrete instances that appeared in a puzzle book, and solve them by using an IP solver, and show the experimental results; each problem can be solved in a second.
Rights: Copyrights of the article is maintained by the authors. Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara and Yushi Uno, Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013), 2013, 31-36.
URI: http://hdl.handle.net/10119/11619
Material Type: author
Appears in Collections:b11-1. 会議発表論文・発表資料 (Conference Papers)

Files in This Item:

File Description SizeFormat
19459.pdf129KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 


Contact : Library Information Section, Japan Advanced Institute of Science and Technology