{"updated":"2025-01-23T01:44:36.617354+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00012241","sets":["581:690:696"]},"path":["696"],"owner":"1","recid":"12241","title":["体系的検索による裸玉詰将棋問題の創作"],"pubdate":{"attribute_name":"公開日","attribute_value":"2000-07-15"},"_buckets":{"deposit":"24f9e66d-db54-43d1-8d12-6b8ba310fb68"},"_deposit":{"id":"12241","pid":{"type":"depid","value":"12241","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":"Systematic Discovery Method of \"Shogi\" Mating Problems of Naked King","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2000-07-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTTコミュニケーション科学基礎研究所"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Communication Science Laboratories","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/12241/files/IPSJ-JNL4107001.pdf"},"date":[{"dateType":"Available","dateValue":"2002-07-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL4107001.pdf","filesize":[{"value":"295.3 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":"538c6aac-0e54-48ba-83fc-3c16800ede7e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2000 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小山, 謙二"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kenji, Koyama","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":"盤面の駒が玉1枚の裸玉詰将棋問題は，簡素な配置ゆえそれ自身高度な芸術性を持つ論理ゲームである．裸玉問題を解いたり，創作（発見）するのは人間にもコンピュータにも難しい．すべての裸玉問題を体系的に解明することが課題となっている．まずすでに発表されている裸玉問題を検討した．次に，詰む最小持駒集合の定義と性質を述べ，体系的に新作問題の候補を見つけ出す方法を明らかにした．最後に，詰将棋プログラムとコンピュータを援用して，玉の位置が1八の問題を網羅的に探索した．その結果，完備な詰む最小持駒集合を得るとともに，5つの準完全作と1つの完全作を発見した．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A “Shogi” mating problem of nakedking, where only a king is on a board, is highly artistic andlogical puzzle. Both solving andmaking (discovering) such problems are difficult for human beings andcomputers. Systematic evaluations of all nakedking mating problems have not been fully done, and it is an attractive research subject for computer science. At first, previously published naked king mating problems are discussed. We formulated and discussed matable minimum “motikoma”s (droppable pieces in mater’s hand) and their complete set. For a case study in which the naked king’s position is 18, we searched a matable complete set by a computer-aided method, and discovered six perfect (i.e., unique mating sequences) problems.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1936","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1923","bibliographicIssueDates":{"bibliographicIssueDate":"2000-07-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7","bibliographicVolumeNumber":"41"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"ゲームプログラム"}]},"weko_creator_id":"1"},"created":"2025-01-18T22:46:39.103074+00:00","id":12241,"links":{}}