Abstract
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. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Haraguchi, K., & Ono, H. (2014). Approximability of Latin square completion-type puzzles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8496 LNCS, pp. 218–229). Springer Verlag. https://doi.org/10.1007/978-3-319-07890-8_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
