{"updated":"2025-01-22T00:36:41.544800+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00067454","sets":["581:582:5992"]},"path":["5992"],"owner":"11","recid":"67454","title":["モンテカルロ木探索によるコンピュータ将棋"],"pubdate":{"attribute_name":"公開日","attribute_value":"2009-11-15"},"_buckets":{"deposit":"b64e8838-dd11-465e-aed7-f59c320ec58c"},"_deposit":{"id":"67454","pid":{"type":"depid","value":"67454","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"モンテカルロ木探索によるコンピュータ将棋","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"モンテカルロ木探索によるコンピュータ将棋"},{"subitem_title":"A Shogi Program Based on Monte-Carlo Tree Search","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"一般論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2009-11-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"筑波大学大学院システム情報工学研究科"},{"subitem_text_value":"筑波大学大学院システム情報工学研究科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Systems and Information Engineering, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Systems and Information Engineering, University of Tsukuba","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/67454/files/IPSJ-JNL5011015.pdf"},"date":[{"dateType":"Available","dateValue":"2011-11-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5011015.pdf","filesize":[{"value":"491.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"304b6453-64b7-4338-85f6-045de594ffc4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2009 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"佐藤佳州"},{"creatorName":"高橋, 大介"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yoshikuni, Sato","creatorNameLang":"en"},{"creatorName":"Daisuke, Takahashi","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":"本論文では，モンテカルロ木探索によるコンピュータ将棋を実現し，その有効性を検証する．モンテカルロ木探索によるゲームの実現は，ゲームプログラミングの分野において現在最も注目を集めているテーマの1つであるが，将棋では今のところ良い結果を得ることには成功していない．本研究では，コンピュータ囲碁で成功した手法を基に，キラームーブの導入など将棋向けの改良を加えたモンテカルロ木探索によるコンピュータ将棋を実現した．次の一手問題による性能評価では，アマチュア初段程度のプログラムに迫る正答数を得ることに成功し，モンテカルロ木探索が将棋においても有効であることを示した．現在のトップレベルの将棋プログラムはプロに迫るまでとなっており，モンテカルロ木探索のみにより従来の手法を単純に上回る棋力を得ることは難しいと考えられる．しかし，序盤の定跡選択や一部の終盤では従来の手法よりも良い結果を得ることに成功し，モンテカルロ木探索の利用により，現在のコンピュータ将棋の性能をさらに改善できる可能性があることを示した．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Recently, Monte-Carlo Tree Search is attracting much attention in game programming. This method has succeeded in Computer-Go, however it has not yet been able to attain good results in Computer-Shogi. We implemented a Shogi program based on Monte-Carlo Tree Search, using techniques proved in Computer-Go with improvements for Computer-Shogi. In the results of solving problems, the number of correct answers that our program found was almost the same as that of about a 1-dan amateur program. Although the strength of top-level Shogi programs is almost as strong as professional players, our method based on Monte-Carlo Tree Search achieved better performance than existing methods in openings and some positions of the endgame. The results of our experiments showed that Monte-Carlo Tree Search has the possibility of improving the performance of Computer-Shogi.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2751","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"2740","bibliographicIssueDates":{"bibliographicIssueDate":"2009-11-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"11","bibliographicVolumeNumber":"50"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:27:52.312064+00:00","id":67454,"links":{}}