{"links":{},"id":68067,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00068067","sets":["1164:5305:6039:6040"]},"path":["6040"],"owner":"10","recid":"68067","title":["Nested Monte-Carlo探索のAMAFを用いた探索数調整による改良"],"pubdate":{"attribute_name":"公開日","attribute_value":"2010-03-01"},"_buckets":{"deposit":"60b4e7ab-58b1-4704-a9fd-fb1bf8320536"},"_deposit":{"id":"68067","pid":{"type":"depid","value":"68067","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"Nested Monte-Carlo探索のAMAFを用いた探索数調整による改良","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Nested Monte-Carlo探索のAMAFを用いた探索数調整による改良"},{"subitem_title":"Nested Monte-Carlo Search Improvement by Search Number Adjustment using AMAF","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"その他","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2010-03-01","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京農工大学工学部情報工学科"},{"subitem_text_value":"東京農工大学大学院工学府"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer and Information Sciences, Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Technology, Tokyo University of Agriculture and Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/68067/files/IPSJ-GI10023007.pdf"},"date":[{"dateType":"Available","dateValue":"2012-03-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GI10023007.pdf","filesize":[{"value":"1.6 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"18"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"174baf08-7368-468b-9411-393fd3f625a4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2010 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"秋山, 晴彦"},{"creatorName":"小谷, 善行"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Haruhiko, Akiyama","creatorNameLang":"en"},{"creatorName":"Yoshiyuki, Kotani","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11362144","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"モンテカルロ探索を入れ子的に呼び出すNested Monte-Carlo探索は，Morpion Solitaireというパズルゲームにおいて成果を上げている．入れ子の深さをレベルと呼び，上位レベルの探索では実行時間が指数関数的に増加する．本研究では，AMAF手法の手数の換算を用いて，擬似的な探索数を維持しつつ探索実行数を削減し，高速化による高レベル化を実現した．この手法によりMorpion SolitaireのTouchingルールにおいて，我々はコンピュータ探索の世界記録145手を達成した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Nested Monte-Carlo Search, which calls Monte Carlo search in the nested call, has succeeded in the puzzle game named Morpion Solitaire. The depth for the nest is called a level, and the execution time increases exponentially in the search for meta level. In the present study, the number of search was reduced to maintain a pseudo number of searches by using the conversion of the AMAF technique, and we achieved the high level Nested Monte-Carlo search. Our system generated a new world record 145 moves of the computer search in Morpion Solitaire Touching version by this technique.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告ゲーム情報学（GI）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2010-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7","bibliographicVolumeNumber":"2010-GI-23"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:28:12.549043+00:00","updated":"2025-01-22T00:22:38.131149+00:00"}