{"updated":"2025-01-21T23:12:12.022351+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00071074","sets":["581:5994:6209"]},"path":["6209"],"owner":"11","recid":"71074","title":["探索結果を利用した実現確率探索"],"pubdate":{"attribute_name":"公開日","attribute_value":"2010-11-15"},"_buckets":{"deposit":"80a768fb-fbc5-4848-9183-0392cc655c52"},"_deposit":{"id":"71074","pid":{"type":"depid","value":"71074","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":"The Realization Probability Search Based on Search Results","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"特集：ゲームプログラミング","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2010-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/71074/files/IPSJ-JNL5111002.pdf"},"date":[{"dateType":"Available","dateValue":"2012-11-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5111002.pdf","filesize":[{"value":"448.2 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":"15af4438-a268-47e7-9f05-b745cc06148c","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2010 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":"In this paper, we propose a realization probability search algorithm based on search results. The realization probability search is one of the search algorithms attracting much attention in the Computer-Shogi area, and it is used by many top-level programs. This method determines search depths according to probabilities of moves obtained from game records by professional players, and searches deeper for more probable moves. The realization probability search is an efficient algorithm, but it is considered that it still has room for improvement because probabilities of moves are fixed at any time. We improved the realization probability search by using the search results. In our method, probabilities change according to the rest of search depths and heuristics obtained while searching. In the result of our experiments, our program based on the proposed method is superior to existing methods.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2030","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"2021","bibliographicIssueDates":{"bibliographicIssueDate":"2010-11-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"11","bibliographicVolumeNumber":"51"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:30:05.262389+00:00","id":71074,"links":{}}