Approximability of Latin square completion-type puzzles

Kazuya Haraguchi, Hirotaka Ono

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationFun with Algorithms - 7th International Conference, FUN 2014, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783319078892
Publication statusPublished - 2014
Event7th International Conference on Fun with Algorithms, FUN 2014 - Sicily, Italy
Duration: Jul 1 2014Jul 3 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8496 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other7th International Conference on Fun with Algorithms, FUN 2014

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Approximability of Latin square completion-type puzzles'. Together they form a unique fingerprint.

Cite this