{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00142068","sets":["581:7706:7711"]},"path":["7711"],"owner":"11","recid":"142068","title":["How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-05-15"},"_buckets":{"deposit":"f23ef154-948f-44f3-b35c-f8eb17835012"},"_deposit":{"id":"142068","pid":{"type":"depid","value":"142068","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately","author_link":["209481","209482","209483","209484"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately"},{"subitem_title":"How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[特集：娯楽の離散数理] Latin square Completion-Type puzzles, approximation algorithms, Sudoku, Futoshiki, KenKen","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2015-05-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Faculty of Commerce, Otaru University of Commerce"},{"subitem_text_value":"Faculty of Economics, Kyushu University"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Commerce, Otaru University of Commerce","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Economics, Kyushu University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":11,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/142068/files/IPSJ-JNL5605008.pdf","label":"IPSJ-JNL5605008"},"date":[{"dateType":"Available","dateValue":"2017-05-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5605008.pdf","filesize":[{"value":"327.9 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"d40647fe-7d3f-437c-bf10-6241bf47cec9","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2015 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazuya, Haraguchi"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hirotaka, Ono"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazuya, Haraguchi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hirotaka, Ono","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"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.\n\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.23.276\n------------------------------","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"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.\n\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.23.276\n------------------------------","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2015-05-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"56"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"updated":"2025-01-20T06:44:09.150641+00:00","created":"2025-01-19T00:19:34.054798+00:00","id":142068}