{"updated":"2025-01-21T09:29:19.085182+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00106493","sets":["6164:6165:6210:7725"]},"path":["7725"],"owner":"11","recid":"106493","title":["囲碁と五目並べにおけるSHOTアルゴリズムの有効性の実験的評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-10-31"},"_buckets":{"deposit":"dfc9a611-cb69-4862-9b45-75c71512af99"},"_deposit":{"id":"106493","pid":{"type":"depid","value":"106493","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"囲碁と五目並べにおけるSHOTアルゴリズムの有効性の実験的評価","author_link":["11902","11903","11904","11905"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"囲碁と五目並べにおけるSHOTアルゴリズムの有効性の実験的評価"},{"subitem_title":"An Empirical Evaluation of the Effectiveness of the SHOT algorithm in Go and Gobang","subitem_title_language":"en"}]},"item_type_id":"18","publish_date":"2014-10-31","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学工学部電子情報工学科"},{"subitem_text_value":"東京大学大学院工学系研究科電気系工学専攻"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Information and Communication Engineering, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Department of Electrical Engineering and Information Systems, Graduate School of Engineering, The University of Tokyo","subitem_text_language":"en"}]},"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/106493/files/IPSJ-GPWS2014003.pdf"},"date":[{"dateType":"Available","dateValue":"2014-10-31"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GPWS2014003.pdf","filesize":[{"value":"1.2 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"18"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"32a43f2d-f5ea-4cbd-9c8a-2e8ad61e89dd","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"本上, 雅央"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鶴岡, 慶雅"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masahiro, Honjo","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yoshimasa, Tsuruoka","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ゲームアルゴリズムにおいてプレイアウトを用いる探索手法としてはモンテカルロ木探索、中でもUCTが主流であるが、最近SHOTという木探索手法が提案され一部のゲームでUCTとの比較がなされた。本研究ではそれに加え囲碁、五目並べを用いた対戦実験を行った。その結果SHOTはプレイアウト数に対して着手可能点が多い場面ではUCTより優れた探索をする一方、プレイアウト数を増やした時はUCTに及ばないことが分かった。また、詰碁による探索の性能評価も行い、SHOTがUCTに比べ、正解手が限定され、深い読みが必要となる場面での探索が苦手であることも分かった。","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Today, UCT is the most widely used Monte-Carlo Tree Search (MCTS) method in games like Go. Recently, a new MCTS method called SHOT has been proposed and compared to UCT in some games. In this paper, we compare the performance of SHOT and UCT in the game of Go and Gobang. Experimental results suggest that SHOT is inferior to UCT when many playouts are performed, and that SHOT is superior to UCT when there are many legal moves in comparison with the number of playouts. We have also conducted experiments with composed Go problems and found that SHOT can perform poorly at situations that require a deep search.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"24","bibliographic_titles":[{"bibliographic_title":"ゲームプログラミングワークショップ2014論文集"}],"bibliographicPageStart":"17","bibliographicIssueDates":{"bibliographicIssueDate":"2014-10-31","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2014"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:49:53.254745+00:00","id":106493,"links":{}}