{"links":{},"id":32032,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032032","sets":["1164:2592:2640:2643"]},"path":["2643"],"owner":"1","recid":"32032","title":["詰将棋を解くプログラムにおける効率的なハッシュの利用法について"],"pubdate":{"attribute_name":"公開日","attribute_value":"2001-07-27"},"_buckets":{"deposit":"5701faa0-01d5-4457-a574-636ef0e35eb4"},"_deposit":{"id":"32032","pid":{"type":"depid","value":"32032","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 Method to use Hash Table Efficiently When Solving Tsume - Shougi","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2001-07-27","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/32032/files/IPSJ-AL01079004.pdf"},"date":[{"dateType":"Available","dateValue":"2003-07-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL01079004.pdf","filesize":[{"value":"1.0 MB"}],"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":"5813c63d-c333-4b52-9792-1933c2bed5d7","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":"今井, 浩"}],"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年 の間に大きく進歩したが、ハッシュの実装についてはこれまでと同様に、あまり論じられることはなかった。我々は詰将棋を解くアルゴリズムの研究を行ってきて、十分な成果を挙げてきたが、これまであまり論じられることのなかった、ハッシュの実装について、この論文で論じたい。我々の実装しているハッシュでは、占有率が80％になると、SmallTreeGCを用いて、全ハッシュの30％を捨て、80％未満ならSmallTreeReplacementで置き換えている。この2つのパラメータの根拠となるデータを提示する。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The algorithms to search adversary-agent games like Shogi or Chess have been widely discussed. Although hash tables (transposition tables) are always implemented with depthfirst algorithms, they are rarely discussed. This situation is also the same with Tsume-Shogi. We have already studied an algorithum to solve Tsume-shougi problems. In this paper we would like to take up our implemention of hash table. Our hash table removes 30% of all entries by SmallTreeGC when load factor exceed 80%. While lode factor is under 80%, the hash table replaces an entry with a new one by SmallTreeReplacement. We would like to show some figures that are grounding these numerical values.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"26","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"21","bibliographicIssueDates":{"bibliographicIssueDate":"2001-07-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"79(2001-AL-079)","bibliographicVolumeNumber":"2001"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:01:13.320443+00:00","updated":"2025-01-22T16:21:33.012724+00:00"}