|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/12147
|
| Title: | Computational complexity and an integer programming model of Shakashaka |
| Authors: | Demaine, Erik D.
Okamoto, Yoshio
Uehara, Ryuhei
Uno, Yushi |
| Keywords: | integer programming
NP-complete
pencil-and-paper puzzle
Shakashaka |
| Issue Date: | 2014-06-01 |
| Publisher: | 電子情報通信学会 |
| Magazine name: | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume: | E97-A |
| Number: | 6 |
| Start page: | 1213 |
| End page: | 1219 |
| 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. |
| Rights: | Copyright (C)2014 IEICE. Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, and Yushi Uno, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E97-A(6), 2014, 1213-1219. http://www.ieice.org/jpn/trans_online/ |
| URI: | http://hdl.handle.net/10119/12147 |
| Material Type: | publisher |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 20242.pdf | | 1535Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
