Computational Complexity and an Integer Programming Model of Shakashaka-Reference-Cited by-同舟云学术

Computational Complexity and an Integer Programming Model of Shakashaka

Published:2014 Issue:6 Volume:E97.A Page:1213-1219
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

DEMAINE Erik D.¹,OKAMOTO Yoshio²,UEHARA Ryuhei³,UNO Yushi⁴

Affiliation:

1. MIT Computer Science and Artificial Intelligence Laboratory

2. Graduate School of Informatics and Engineering, The University of Electro-Communications

3. School of Information Science, JAIST

4. Graduate School of Science, Osaka Prefecture University

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E97.A/6/E97.A_1213/_pdf

Reference11 articles.

1. [1] Nikoli, Shakashaka 1, vol.151, Pencil and Paper Puzzle Series, Nikoli, Jan. 2012.

2. [2] R.A. Hearn and E.D. Demaine, Games, Puzzles, and Computation, A K Peters Ltd., 2009.

3. [3] T. Koch, T. Achterberg, E. Andersen, O. Bastert, T. Berthold, R.E. Bixby, E. Danna, G. Gamrath, A.M. Gleixner, S. Heinz, A. Lodi, H.D. Mittelmann, T.K. Ralphs, D. Salvagnin, D.E. Steffy, and K. Wolter, “MIPLIB 2010,” Math. Program. Comput., vol.3, no.2, pp.103-163, 2011.

4. [4] A. Bartlett, T.P. Chartier, A.N. Langville, and T.D. Rankin, “Integer programming model for the sudoku problem,” J. Online Mathematics and its Applications, vol.8, Article ID 1798, 2008.

5. [5] R.A. Bosch, “Painting by numbers,” Optima, vol.65, pp.16-17, 2001.

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Faster Cooperative Lane Change Controller Enabled by Formulating in Spatial Domain;IEEE Transactions on Intelligent Vehicles;2023-12

2. Computational Complexity of Puzzles and Related Topics;Interdisciplinary Information Sciences;2023

3. Five Cells and Tilepaint are NP-Complete;IEICE Transactions on Information and Systems;2022-03-01

4. On the Minimum Number of Pieces for Two-Dimensional Anti-Slide Using T-Tetrominoes;IEICE Transactions on Information and Systems;2021-03-01

5. Computational Complexity of Two Pencil Puzzles: Kurotto and Juosan;Discrete and Computational Geometry, Graphs, and Games;2021