Approximability of Latin Square Completion-Type Puzzles
Among many variations of pencil puzzles, Latin square Completion-Type puzzles (LSCP), such as Sudoku, Futoshiki and BlockSum, are quite popular for puzzle fans. Concerning these puzzles, the solvability has been investigated from the viewpoint of time complexity in the last decade; it has been shown that, in most of these puzzles, it is NP-complete to determine whether a given puzzle instance has a proper solution. In this paper, we investigate the approximability of LSCP. We formulate LSCP as the maximization problem that asks to fill as many cells as possible, under the Latin square condition and the inherent condition. We then propose simple generic approximation algorithms for LSCP and analyze their approximation ratios.
KeywordsLatin square Completion-Type puzzles approximation algorithms Sudoku Futoshiki BlockSum
Unable to display preview. Download preview PDF.
- 4.Cygan, M.: Improved approximation for 3-dimensional matching via bounded pathwidth local search. arXiv preprint arXiv:1304.1424 (2013)Google Scholar
- 5.Demaine, E.D., Okamoto, Y., Uehara, R., Uno, Y.: Computational complexity and an integer programming model of Shakashaka. In: CCCG, pp. 31–36 (2013)Google Scholar
- 10.Hearn, R.A., Demaine, E.D.: Games, puzzles, and computation. AK Peters, Limited (2009)Google Scholar
- 12.Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103 (1972)Google Scholar
- 15.Miyamoto, T.: Black Belt KenKen: 300 Puzzles. Puzzlewright (2013)Google Scholar
- 16.Miyamoto, T.: Brown Belt KenKen: 300 Puzzles. Puzzlewright (2013)Google Scholar
- 17.Miyamoto, T.: Green Belt KenKen: 300 Puzzles. Puzzlewright (2013)Google Scholar
- 18.Miyamoto, T.: White Belt KenKen: 300 Puzzles. Puzzlewright (2013)Google Scholar
- 19.Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 86(5), 1052–1060 (2003)Google Scholar