2026-03-09T20:50:28Z https://barrel.repo.nii.ac.jp/oai

oai:barrel.repo.nii.ac.jp:00004816 2025-03-17T00:20:54Z 1:536 4

How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately Haraguchi, Kazuya Ono, Hirotaka 利用は著作権の範囲内に限定される 007 情報学 Latin square Completion-Type puzzles approximation algorithms Sudoku Futoshiki Kenken Among many variations of pencil puzzles, Latin square Completion-Type puzzles (LSCPs) 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 three LSCPs: Sudoku, Futoshiki and Kenken. We formulate each LSCP as a 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 them and analyze their approximation ratios. Information Processing Society of Japan 2015-05 eng journal article VoR http://hdl.handle.net/10252/5462 https://barrel.repo.nii.ac.jp/records/4816 info:doi/10.2197/ipsjjip.23.276 AA00700121 0387-6101 Journal of Information Processing 23 3 276 283 https://barrel.repo.nii.ac.jp/record/4816/files/JIP_23_3.pdf application/pdf 329.5 kB 2016-01-26