WEKO3
アイテム
How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately
https://ipsj.ixsq.nii.ac.jp/records/142068
https://ipsj.ixsq.nii.ac.jp/records/1420686e29c0a8-46cf-4340-8363-f889c117c88b
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5605008 (327.9 kB)
|
Copyright (c) 2015 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2015-05-15 | |||||||||
| タイトル | ||||||||||
| タイトル | How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [特集：娯楽の離散数理] Latin square Completion-Type puzzles, approximation algorithms, Sudoku, Futoshiki, KenKen | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Faculty of Commerce, Otaru University of Commerce | ||||||||||
| 著者所属 | ||||||||||
| Faculty of Economics, Kyushu University | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Faculty of Commerce, Otaru University of Commerce | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Faculty of Economics, Kyushu University | ||||||||||
| 著者名 |
Kazuya, Haraguchi
× Kazuya, Haraguchi
× Hirotaka, Ono
|
|||||||||
| 著者名(英) |
Kazuya, Haraguchi
× Kazuya, Haraguchi
× Hirotaka, Ono
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | 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. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online) DOI http://dx.doi.org/10.2197/ipsjjip.23.276 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | 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. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online) DOI http://dx.doi.org/10.2197/ipsjjip.23.276 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 56, 号 5, 発行日 2015-05-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
