{"links":{},"id":11597,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00011597","sets":["581:664:671"]},"path":["671"],"owner":"11","recid":"11597","title":["df-pnアルゴリズムの詰将棋を解くプログラムへの応用"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-06-15"},"_buckets":{"deposit":"f9f72099-b69c-4ae2-aaf3-2f4f3017b6bb"},"_deposit":{"id":"11597","pid":{"type":"depid","value":"11597","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"df-pnアルゴリズムの詰将棋を解くプログラムへの応用","author_link":["361806","361805","361803","361804"],"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_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文（論文賞受賞）","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2002-06-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学大学院理学系研究科"},{"subitem_text_value":"東京大学大学院理学系研究科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Science, University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Science, University of Tokyo","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/11597/files/IPSJ-JNL4306020.pdf","label":"IPSJ-JNL4306020"},"date":[{"dateType":"Available","dateValue":"2004-06-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL4306020.pdf","filesize":[{"value":"235.1 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"83502d7f-9304-49f0-a752-df7ca8382552","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"長井, 歩"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"今井, 浩"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ayumu, Nagai","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroshi, Imai","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"詰将棋を解くプログラムの研究はこの10年の間に大きく進歩した．その原動力となったのは，証明数や反証数という概念の導入である．詰将棋に適用すると，直感的にいうと，証明数は玉の逃げ方の総数を，反証数は攻め方の王手の総数を表す．前者は攻め方にとって，後者は玉方にとって非常に重要な値である．証明数・反証数を対等に扱った，最もナイーブなアルゴリズムは，Allisによるpn-searchという最良優先探索法である．我々は近年，df-pnアルゴリズムという，pn-searchと同等の振舞いをする深さ優先探索法を提案している．この論文では，df-pnアルゴリズムを用いて詰将棋を解く強力なプログラムを作成し，その過程で導入した様々な技法を提案する．これらの技法をdf-pnの上に実装することにより，我々のプログラムでは300手以上の詰将棋のすべてを解くことに初めて成功した．しかもそれは，シングルプロセッサのワークステーションで解くなど，解答能力と解答時間の両面で優れた結果を出すことができた．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"During this decade, a study of programs to solve Tsume-Shogi problemshas greatly advanced. This is due to the development ofthe concept of a proof number and a disproof number.Allis' pn-search is the most naive best-first algorithm that usesboth proof numbers and disproof numbers on equal terms.We already developed a df-pn algorithm which is a depth-firstalgorithm that behaves the same as pn-search.In this paper, we applied df-pn algorithm to a program solvingTsume-Shogi problems. Moreover, we propose some techniqueswhich we imported during implementing the program.As a result, by these techniques implemented on df-pn,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_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1777","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1769","bibliographicIssueDates":{"bibliographicIssueDate":"2002-06-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"43"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"アルゴリズム理論"}]},"weko_creator_id":"11"},"created":"2025-01-18T22:46:11.123854+00:00","updated":"2025-01-20T06:31:46.985100+00:00"}