{"updated":"2025-01-21T15:32:14.303179+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00091349","sets":["6164:6165:6210:7138"]},"path":["7138"],"owner":"10","recid":"91349","title":["局面情報からの探索信頼性の推定による将棋のProbCutの性能向上"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-11-09"},"_buckets":{"deposit":"80b140ab-da7f-45ef-9dcf-247a89283077"},"_deposit":{"id":"91349","pid":{"type":"depid","value":"91349","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"局面情報からの探索信頼性の推定による将棋のProbCutの性能向上","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"局面情報からの探索信頼性の推定による将棋のProbCutの性能向上"},{"subitem_title":"Improving the Performance of ProbCut by Using Positional Features in Shogi","subitem_title_language":"en"}]},"item_type_id":"18","publish_date":"2012-11-09","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":"東京大学大学院工学系研究科"},{"subitem_text_value":"マンチェスター大学コンピュータ科学科"},{"subitem_text_value":"東京大学大学院工学系研究科"},{"subitem_text_value":"東京大学大学院工学系研究科"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Engineering Department, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"School of Computer Science, The University of Manchester","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"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/91349/files/IPSJ-GPWS2012013.pdf"},"date":[{"dateType":"Available","dateValue":"2013-03-22"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GPWS2012013.pdf","filesize":[{"value":"461.4 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e6eb486c-91d7-401d-864a-05c058ac1614","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"亀甲, 博貴"},{"creatorName":"浦, 晃"},{"creatorName":"三輪, 誠"},{"creatorName":"鶴岡, 慶雅"},{"creatorName":"近山, 隆"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hirotaka, Kameko","creatorNameLang":"en"},{"creatorName":"Akira, Ura","creatorNameLang":"en"},{"creatorName":"Makoto, Miwa","creatorNameLang":"en"},{"creatorName":"Yoshimasa, Tsuruoka","creatorNameLang":"en"},{"creatorName":"Takashi, Chikayama","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":"将棋などのコンピュータプレイヤは，局面の形勢判断を行う評価関数を用いてゲーム木探索を行っている．しかし評価関数が返す値はあくまで注目する局面を点として見たときの価値でありその価値がどの程度安定しているものであるか分からない．その局面からどれだけ形勢が変化しうるのかを検討することはその探索結果が信頼できるものであるかを考える上で重要である．本研究では浅い探索で得られる評価値と深い探索で得られる評価値の間の相関を調べる．また浅い探索の信頼性が浅い探索で得られる評価値と深い探索で得られる評価値の差の分布で表現できると仮定して，注目局面の特徴情報から深浅差の標準偏差を推定する手法を提案する．深浅差が小さいと予測される局面は浅い探索のみを行えば深い探索を省略してもその危険性が少ないと考えられるので，そのような局面についてProbCut を行うことで将棋プログラムの棋力向上を図る．将棋への ProbCut への有効性は確認できたが，提案手法によるProbCut の有意な性能向上は見られなかった．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Computer shogi players usually use evaluation function in game-tree search. However, the values returned by evaluation functions are point estimates of the values of the positions and do not convey information about how reliable they are. It is important to estimate their level of reliability by quantifying how much those values may change. In this paper, we investigate the distribution of gaps between shallow and deep evaluation values and propose two methods to estimate it. We also try to improve performance of ProbCut using the variance of distribution. ProbCut is effective in Shogi, but proposed method couldn’t improve performance of ProbCut.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"99","bibliographic_titles":[{"bibliographic_title":"ゲームプログラミングワークショップ2012論文集"}],"bibliographicPageStart":"92","bibliographicIssueDates":{"bibliographicIssueDate":"2012-11-09","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"2012"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:40:38.692736+00:00","id":91349,"links":{}}