{"links":{},"id":32069,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032069","sets":["1164:2592:2647:2648"]},"path":["2648"],"owner":"1","recid":"32069","title":["df - pnアルゴリズムの詰将棋解答プログラムへの応用"],"pubdate":{"attribute_name":"公開日","attribute_value":"2000-11-10"},"_buckets":{"deposit":"07d86712-c816-409d-b97e-70e5259fbf6a"},"_deposit":{"id":"32069","pid":{"type":"depid","value":"32069","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"df - pnアルゴリズムの詰将棋解答プログラムへの応用","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"df - pnアルゴリズムの詰将棋解答プログラムへの応用"},{"subitem_title":"Application of df - pn Algorithm to a Program to Solve Tsume - Shogi Problems","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2000-11-10","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 Information Science, Faculty of Science, University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Science, Faculty of Science, University of Tokyo","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/32069/files/IPSJ-AL00075002.pdf"},"date":[{"dateType":"Available","dateValue":"2002-11-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL00075002.pdf","filesize":[{"value":"767.5 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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"c26683a7-f362-4ed9-acde-84d8a27fd223","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2000 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":"Ayumu, Nagai","creatorNameLang":"en"},{"creatorName":"Hiroshi, Imai","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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":"詰将棋を解くプログラムの研究はこの10年の間に大きく進歩した．その原動力となったのは，証明数や反証数という概念の導入である．詰将棋に適用すると，大雑把に言うと，証明数は玉の逃げ方の総数を，反証数は攻め方の王手の総数を表す．前者は攻め方にとって，後者は玉方にとって非常に重要な値である．証明数・反証数を対等に扱った，ナイーブなアルゴリズムは，Allisのpn-searchという最良優先探索法である．我々は近年，df-pnアルゴリズムという，pn-searchと同等の振る舞いをする深さ優先探索法を提案している．この論文では，df-pnアルゴリズムを詰将棋を解くプログラムに応用した．その結果，300手以上の詰将棋をすべて解くことに初めて成功するなど，解答能力と解答時間の両面で優れた結果を出すことができた．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"During this decade, a study of programs to solve Tsume-Shogi problems has greatly advanced. This is due to the development of the concept of a proof number and a disproof number. Allis' pn-search is a naive best-first algorithm that uses both proof numbers and disproof numbers on equal terms. We already developed a df-pn algorithm which is a depth-first algorithm that behaves the same as pn-search. In this paper, we applied df-pn algorithm to a prgram solving Tsume-Shogi problems. As a result, our program solved all the Tsume-Shogi problems for the first time, that require over 300 plies to reach to the checkmate.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"16","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"9","bibliographicIssueDates":{"bibliographicIssueDate":"2000-11-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"103(2000-AL-075)","bibliographicVolumeNumber":"2000"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:01:14.985784+00:00","updated":"2025-01-22T16:20:24.126111+00:00"}