{"id":240728,"links":{},"created":"2025-01-19T01:45:04.814875+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00240728","sets":["6164:6165:6210:11853"]},"path":["11853"],"owner":"44499","recid":"240728","title":["バックギャモンのエンドゲームデータベース拡張の試み"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-11-15"},"_buckets":{"deposit":"c68ddc5b-2be0-42d7-a185-02be95d548a2"},"_deposit":{"id":"240728","pid":{"type":"depid","value":"240728","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"バックギャモンのエンドゲームデータベース拡張の試み","author_link":["660922","660921","660920","660923"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"バックギャモンのエンドゲームデータベース拡張の試み"},{"subitem_title":"A Study of Expansion of the Endgame Database of Backgammon","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ボードゲーム","subitem_subject_scheme":"Other"},{"subitem_subject":"バックギャモン","subitem_subject_scheme":"Other"},{"subitem_subject":"エンドゲームデータベース","subitem_subject_scheme":"Other"},{"subitem_subject":"後ろ向き帰納法","subitem_subject_scheme":"Other"},{"subitem_subject":"グリーディ方策","subitem_subject_scheme":"Other"},{"subitem_subject":"モンテカルロ法","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2024-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":"電気通信大学"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"The University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"The University of Electro-Communications","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/240728/files/IPSJ-GPWS2024010.pdf","label":"IPSJ-GPWS2024010.pdf"},"date":[{"dateType":"Available","dateValue":"2024-11-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GPWS2024010.pdf","filesize":[{"value":"641.1 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":"18"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"187203db-d83e-4256-9e5b-ac0bdf182e88","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 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":"Yuki, Sanno","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kunihito, Hoki","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":"本研究では，2人零和不確定ゲームであるバックギャモンの終盤におけるデータベース（エンドゲームデータベース， EGDB）の拡張を目指す．そして，既存の GNU Backgammon で構築される両側ベアオフデータベース（BODB）では扱えない配置に対しても適切な勝率を求める．そのために，後ろ向き帰納法とグリーディ方策を用いたモンテカルロ法を採用する．後ろ向き帰納法によって，ベアオフされた駒が(黒, 白) = (14, 14)， (13, 14)， (14, 13) の配置の一部に対して，正確な勝率を求めることができた．また，グリーディ方策を用いたモンテカルロ法を，ベアオフされた駒が (黒, 白) = (14, 14) の配置集合に対して実行すると，全ての配置の推定勝率を高い精度で求められることが明らかになった．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This study aims to extend the endgame database (EGDB) of backgammon, a two-player zero-sum game with uncertainty. Additionally, this study seeks to compute accurate winning probabilities for positions that cannot be handled by the existing Bearoff Database (BODB) constructed by GNU Backgammon. To achieve this, we employ backward induction and the Monte-Carlo method with greedy policies. Through backward induction, we were able to compute accurate winning probabilities for certain positions where the number of bearing off checkers are (black, white) = (14, 14), (13, 14), and (14, 13). Furthermore, by applying the Monte-Carlo method with greedy policies to the set of positions where the bearing off checkers are (black, white) = (14, 14), we found that estimated winning probabilities for all positions could be obtained with high accuracy.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"71","bibliographic_titles":[{"bibliographic_title":"ゲームプログラミングワークショップ2024論文集"}],"bibliographicPageStart":"66","bibliographicIssueDates":{"bibliographicIssueDate":"2024-11-15","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T07:53:12.325530+00:00"}