{"updated":"2025-01-19T17:47:00.379434+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00211492","sets":["1164:5305:10533:10609"]},"path":["10609"],"owner":"44499","recid":"211492","title":["探索アルゴリズムに適した時間利用に関する研究"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-06-12"},"_buckets":{"deposit":"43e94c67-ea2c-403e-af0e-dab1556aff59"},"_deposit":{"id":"211492","pid":{"type":"depid","value":"211492","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"探索アルゴリズムに適した時間利用に関する研究","author_link":["537403"],"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":"4","publish_date":"2021-06-12","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"岡山県立大学情報工学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Okayama Prefectural 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/211492/files/IPSJ-GI21046002.pdf","label":"IPSJ-GI21046002.pdf"},"date":[{"dateType":"Available","dateValue":"2023-06-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GI21046002.pdf","filesize":[{"value":"1.1 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":"18"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"6099a0d0-a4c9-4ba3-aa69-6277b290f7dc","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"芝, 世弐"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11362144","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-8736","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"2020 年 11 月に行われた世界将棋 AI 電竜戦において深層学習とモンテカルロ木探索を組み合わせた所謂 PV-MCTS 系のプログラムが優勝し，将棋の探索エンジンとしては同系のものが今後主流となると思われていた．しかしながら，2021 年 5 月に行われた第 31 回世界コンピュータ将棋選手権においては決勝 8 チーム中 1 チームのみが同系エンジンであった．本研究はこの事象を持ち時間の観点から説明を試みる前段階として探索アルゴリズムの時間利用の適性を評価しようとするものである．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"3","bibliographic_titles":[{"bibliographic_title":"研究報告ゲーム情報学（GI）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-06-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"2021-GI-46"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:12:38.444066+00:00","id":211492,"links":{}}