{"id":58622,"created":"2025-01-18T23:21:33.893992+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00058622","sets":["1164:5305:5327:5329"]},"path":["5329"],"owner":"1","recid":"58622","title":["反復深化探索に基く協力詰将棋の解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2001-03-16"},"_buckets":{"deposit":"69a5ebe2-9c7b-48b1-b54d-d9d1f7fa8177"},"_deposit":{"id":"58622","pid":{"type":"depid","value":"58622","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"反復深化探索に基く協力詰将棋の解法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"反復深化探索に基く協力詰将棋の解法"},{"subitem_title":"A New Algorithm for Solving the Cooperative Tsume - Shogi Based on Iterative - Deepening Search","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2001-03-16","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電気通信大学情報工学科"},{"subitem_text_value":"電気通信大学情報工学科"},{"subitem_text_value":"電気通信大学情報工学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, The University of Electro - Communications","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, The University of Electro - Communications","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, The University of Electro - Communications","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/58622/files/IPSJ-GI00005009.pdf"},"date":[{"dateType":"Available","dateValue":"2003-03-16"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GI00005009.pdf","filesize":[{"value":"810.8 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":"18"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"bc1525b2-dc78-431b-8ae6-0466e5dfc00f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2001 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"星, 由雄"},{"creatorName":"野下浩平"},{"creatorName":"柳井, 啓司"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yoshio, Hoshi","creatorNameLang":"en"},{"creatorName":"Kohei, Noshita","creatorNameLang":"en"},{"creatorName":"Keiji, Yanai","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":"協力詰将棋（協力詰）は詰将棋のルールを変形したパズルである．協力詰の問題はOR木の探索問題として定式化できる．本論文では探索問題として協力詰をとりあげ，これを解くための新しいアルゴリズムを提案する．探索法として，反復深化法と局面表（トランスポジション表）の技法を組み合わせた深さ優先探索を用いる．局面表に新しい技法を導入し，探索の高速化と記憶領域の節約を図る．本論文のアルゴリズムを用いて作成したプログラムは，協力詰の最長手数問題である49909手詰の「寿限無3」をはじめ，これまでコンピュータでは解けなかったいくつかの難しい問題を解くことができる．また実例によって，新しい技法は局面の数が多い問題で特に効果が大きいことを示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The cooperative Tsume-shogi, or helpmate, is one of the most popular variants of Tsume-shogi. Solving a helpmate problem can be formulated as an OR-tree searching. We present a new algorithm for solving helpmate. The basic framework of our algorithm consists of depth-first searching, iterative-deepening and a transposition table. Several new techniques for handling information in the transposition table are introduced, by which we achieve considerable memory-savings as well as speed-ups. Our program has solved the longest-step problem named Jugemu 3 with 49909 steps, as well as several hard problems, all of which have been intractable by other previous programs. By experiments we show that our techniques are effective particularly for hard problems which need a large transposition table.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"69","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告ゲーム情報学（GI）"}],"bibliographicPageStart":"63","bibliographicIssueDates":{"bibliographicIssueDate":"2001-03-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"28(2000-GI-005)","bibliographicVolumeNumber":"2001"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"updated":"2025-01-22T03:57:12.082477+00:00","links":{}}