{"id":227602,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00227602","sets":["1164:2592:11085:11322"]},"path":["11322"],"owner":"44499","recid":"227602","title":["数独に対する最も簡単な解法探索による難易度判定付きソルバー"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-08-30"},"_buckets":{"deposit":"0c059490-3ef2-4f9f-b452-1652987387ff"},"_deposit":{"id":"227602","pid":{"type":"depid","value":"227602","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"数独に対する最も簡単な解法探索による難易度判定付きソルバー","author_link":["606465","606466"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"数独に対する最も簡単な解法探索による難易度判定付きソルバー"}]},"item_type_id":"4","publish_date":"2023-08-30","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州工業大学"},{"subitem_text_value":"九州工業大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Kyusyu Institute University","subitem_text_language":"en"},{"subitem_text_value":"Kyusyu Institute University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/227602/files/IPSJ-AL23194004.pdf","label":"IPSJ-AL23194004.pdf"},"date":[{"dateType":"Available","dateValue":"2025-08-30"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL23194004.pdf","filesize":[{"value":"1.2 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"1143bacf-2f4c-48af-ac41-28f9213523ce","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"鹿屋, 直大"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"斎藤, 寿樹"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近年，パズルを自作し，作成したその問題を発表できるサイトの公開などにより，パズルを作成時に自分でその難易度を判断する場面が増えてきた．難易度の判定には，1 つのパズルにある様々な解法の中で最も簡単なものを探す必要がある．しかし，難易度の判定を手作業で行うと，可能な限り全ての解法を考えるため，同じ問題を何度も解き直すため，多くの時間がかかってしまうとともに，見落としにより正確さも保証できない．よって，パズルの問題を入力として与えると目安となる難易度が確認できるソルバーがあるとパズル作家にとって，非常に便利である．本研究では，数独の問題を与えると，解の一意性を判定でき，最も簡単な解法を見つけ，その問題の難易度を計算するアルゴリズムを提案する．また，本提案手法により得られる難易度は本に掲載されている難易度と強い相関を持つことを示す．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-08-30","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"2023-AL-194"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T12:07:36.825374+00:00","created":"2025-01-19T01:26:51.615428+00:00","links":{}}