{"id":97561,"updated":"2025-01-21T12:49:11.758013+00:00","links":{},"created":"2025-01-18T23:44:02.647460+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00097561","sets":["6164:6165:6210:7364"]},"path":["7364"],"owner":"11","recid":"97561","title":["不詰を正しく証明するアルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2004-11-12"},"_buckets":{"deposit":"dcc035c6-9268-4bd1-93ed-e3f20a0f9bd8"},"_deposit":{"id":"97561","pid":{"type":"depid","value":"97561","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"不詰を正しく証明するアルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"不詰を正しく証明するアルゴリズム"},{"subitem_title":"A Correct Algorithm to Prove No-Mate Positions in Shogi","subitem_title_language":"en"}]},"item_type_id":"18","publish_date":"2004-11-12","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, University of Alberta"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, University of Alberta","subitem_text_language":"en"}]},"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/97561/files/IPSJ-GPWS2004001.pdf"},"date":[{"dateType":"Available","dateValue":"2004-11-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GPWS2004001.pdf","filesize":[{"value":"807.2 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"dd14b84b-4c49-44cb-b743-a9475dd65a42","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2004 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"岸本, 章宏"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kishimoto, Akihiro","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"将棋では別手順によって同一局面に至ることがあるために，詰将棋解答プログラムはハッシュ表を用いるのが普通である．ハッシュ表の利用によって，探索に必要な空間を大幅に減らすことができるのだが，将棋には元の局面に戻る手順が存在するために詰将棋プログラムでは，詰む問題を不詰めと間違えるGHI（Graph History Interaction）問題を引き起こすことがある．本論文では[8]の手法を利用してGHI問題に対する正当でかつ効率のよい解決策を提案する．さらに本手法を詰将棋プログラムに実装した結果，詰みの性能を保持しつつ，難解な不詰の問題を解くことに成功した．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Since identical positions can be reached by more than one path in Shogi, tsume-shogi solvers are typically enhanced with transposition tables. This approach can reduce the search effort by a large margin. However, because Shogi contains repetitions, tsume-shogi solvers suffer from the Graph History Interaction (GHI) problem. GHI may cause a solver to falsely regard proven positions as disproven. This paper presents an efficient and correct method to cure the GHI problem, based on the algorithm in [8]. A tsume-shogi solver with our GHI solution is now able to solve harder fu-tsume positions without degradation in the ability to solve tsume positions.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"ゲームプログラミングワークショップ2004論文集"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2004-11-12","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2004"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}