{"created":"2025-01-18T23:44:00.420207+00:00","updated":"2025-01-21T12:51:31.080240+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00097517","sets":["6164:6165:6210:7362"]},"path":["7362"],"owner":"11","recid":"97517","title":["実現確率探索のゲーム全般への応用―Lines of Actionを題材にして―"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-11-15"},"_buckets":{"deposit":"bedb7fa9-4045-443a-a8e0-648e102cb5a4"},"_deposit":{"id":"97517","pid":{"type":"depid","value":"97517","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"実現確率探索のゲーム全般への応用―Lines of Actionを題材にして―","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"実現確率探索のゲーム全般への応用―Lines of Actionを題材にして―"},{"subitem_title":"Application of Realization Probability Search for Any Games - a case study using Lines of Action -","subitem_title_language":"en"}]},"item_type_id":"18","publish_date":"2002-11-15","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":"Department of Computer Science, Universiteit Maastricht"},{"subitem_text_value":"静岡大学情報学部／科学技術振興事業団さきがけ研究21「機能と構成」領域"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Engineering, Shizuoka University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Information, Shizuoka University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Information, Shizuoka University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, Universiteit Maastricht","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Information, Shizuoka University / 'Information and Systems', PRESTO, Japan Science and Technology Corporation","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/97517/files/IPSJ-GPWS2002012.pdf"},"date":[{"dateType":"Available","dateValue":"2002-11-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GPWS2002012.pdf","filesize":[{"value":"1.4 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":"44"}],"accessrole":"open_date","version_id":"1a1aa752-656f-4224-8ca6-c9b477c25c95","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"橋本, 剛"},{"creatorName":"長嶋, 淳"},{"creatorName":"作田, 誠"},{"creatorName":"Jos, Uiterwijk"},{"creatorName":"飯田, 弘之"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hashimoto, Tsuyoshi","creatorNameLang":"en"},{"creatorName":"Nagashima, Jun","creatorNameLang":"en"},{"creatorName":"Sakuta, Makoto","creatorNameLang":"en"},{"creatorName":"Uiterwijk, Jos","creatorNameLang":"en"},{"creatorName":"Iida, Hiroyuki","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":"鶴岡は実現確率探索を考案し，プログラム「激指」に実装して2002年世界コンピュータ将棋選手権を見事に制した．実現確率探索は局面の実現確率を閾値として探索することで，より「有りそう」な手の場合はどんどん深く読み，「無さそう」な手の場合はほとんど読まない．これまで前向き枝刈りと探索延長によって行ってきたことをシステマティックに非常に簡単なアルゴリズムで行う優れた探索法であるといえる．ところが，激指の手法ではプロの棋譜から指し手の確率を計算しており，参考となる棋譜が十分に存在しない多くのゲームではこの手法は通用しない．本稿ではコンピュータの自動学習により指し手の確率を自動で計算し，実現確率探索をあらゆるゲームに応用させる手法，ARPS（自動実現確率探索）を提案する．実験には連結型の二人ゲームLines of Action（LOA）を選び13種類の分類を与えてARPSを実装し分類の確率を計算した．一般的な反復深化探索との対戦結果は，ARPSが反復深化に比べてより深くよりより絞り込んだ読みで大きく勝ち越しその優位性を示した．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Recently, Realization-Probability Search was proposed and implemented in the shogi program GEKISASHI, which won the World Computer Shogi Championship in 2002. It searches deeper after \"probable\" moves and shallower after \"improbable\" moves. It can efficiently perform a selective search similar to forward pruning and search extensions, while using a considerably simpler algorithm in an systematic way. However, since the method in GEKISASHI calculates move-category probabilities form many games by professional players, it cannot be used for games that lack the availability of a sufficient quantity of game records. This paper proposes a technique called Automatic Realization-Probability Search (ARPS), which can be applied to any game. We have selected Lines of Action (LOA), which is a connection-based two-player game and is considered very different from chess-like games. ARPS has been implemented and examined in a LOA program. The results of our experiments have shown that ARPS is superior to normal iterative deepening in strength and perform narrower and deeper searches.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"86","bibliographic_titles":[{"bibliographic_title":"ゲームプログラミングワークショップ2002論文集"}],"bibliographicPageStart":"81","bibliographicIssueDates":{"bibliographicIssueDate":"2002-11-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"17","bibliographicVolumeNumber":"2002"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":97517,"links":{}}