{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00110956","sets":["6504:7208:7826"]},"path":["7826"],"owner":"6748","recid":"110956","title":["整数計画ソルバーを用いた囲碁における連数最大値探索の効率化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-03-06"},"_buckets":{"deposit":"c44bd3ff-9321-48e6-ac41-fbf476adcd18"},"_deposit":{"id":"110956","pid":{"type":"depid","value":"110956","revision_id":0},"owners":[6748],"status":"published","created_by":6748},"item_title":"整数計画ソルバーを用いた囲碁における連数最大値探索の効率化","author_link":["28563","28562"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"整数計画ソルバーを用いた囲碁における連数最大値探索の効率化"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2013-03-06","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"岡山大"},{"subitem_text_value":"岡山大"}]},"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/110956/files/IPSJ-Z75-1B-2.pdf"},"date":[{"dateType":"Available","dateValue":"2014-12-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-Z75-1B-2.pdf","filesize":[{"value":"173.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"c11895b5-038e-4ee5-b06c-4e11aca37e69","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2013 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"神保秀司"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"香西成人"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"囲碁における合法局面中に存在する連と呼ばれる石の集まりの数の最大値を連数最大値と呼ぶ．19路盤に対する連数最大値問題は，それと同値な碁盤グラフに対する最小支配点集合問題を0-1整数計画問題に定式化し，それに対して既存の整数計画ソルバーを適用することにより既に解かれている．本研究では，0-1整数計画問題への定式化において対称な最適解の排除をより促す制約式を構成することにより，従来よりも短時間で連数最大値が求まることを示す．さらに，碁盤を分割して得られる複数の領域に対する支配点集合を整数計画ソルバーにより求め，それらの組合せの中から碁盤全体の最小支配点集合を探索する方法の有効性について述べる．","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"262","bibliographic_titles":[{"bibliographic_title":"第75回全国大会講演論文集"}],"bibliographicPageStart":"261","bibliographicIssueDates":{"bibliographicIssueDate":"2013-03-06","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2013"}]},"relation_version_is_last":true,"weko_creator_id":"6748"},"id":110956,"updated":"2025-01-21T07:32:24.697542+00:00","links":{},"created":"2025-01-18T23:53:09.397485+00:00"}