{"links":{},"id":97675,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00097675","sets":["6164:6165:6210:7367"]},"path":["7367"],"owner":"11","recid":"97675","title":["将棋における局面探索の多重並列計算"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-11-09"},"_buckets":{"deposit":"2ed5168a-38a3-48b6-afc1-e5c4f6e2952b"},"_deposit":{"id":"97675","pid":{"type":"depid","value":"97675","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":"Multiple Parallel Search in Shogi","subitem_title_language":"en"}]},"item_type_id":"18","publish_date":"2007-11-09","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京農工大学工学府情報工学専攻小谷研究室"},{"subitem_text_value":"東京農工大学共生科学技術研究院システム情報科学部門"},{"subitem_text_value":"東京農工大学共生科学技術研究院システム情報科学部門"},{"subitem_text_value":"東京農工大学共生科学技術研究院システム情報科学部門"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo University of Agriculture and Technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo University of Agriculture and Technology","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/97675/files/IPSJ-GPWS2007027.pdf"},"date":[{"dateType":"Available","dateValue":"2007-11-09"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GPWS2007027.pdf","filesize":[{"value":"265.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":"e4abc24e-5f30-47c6-8e0b-cfa900c6cc20","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2007 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"柳, 圭二郎"},{"creatorName":"柴原, 一友"},{"creatorName":"但馬, 康宏"},{"creatorName":"小谷, 善行"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yanagi, Keijiro","creatorNameLang":"en"},{"creatorName":"Shibahara, Kazutomo","creatorNameLang":"en"},{"creatorName":"Tajima, Yasuhiro","creatorNameLang":"en"},{"creatorName":"Kotani, Yoshiyuki","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":"コンピュータ将棋の着手を決定するために最も時間がかかるのは局面探索であり，探索の速度を向上させれば強化につながるとされている．また，近年コンピュータ将棋で注目されているのが複数のコアを持つ CPU による並列計算である．そこで，この局面の並列探索を，並列処理に特化した CPU である Cell Broadband Engine (以下 Cell)を用いて行うとどれだけの効果があるかを実験する．並列化アルゴリズムは既存のものを用いるが，Cell が並列探索に有効かどうかを調べる．最終的には Cell 上に将棋プログラムを実装し，既存のプログラムとの対局の勝率を求める．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"It is takes the time to decide a best move by position search in Shogi, so improving the speed of the search leads to strengthening .Recently, it pays attention to the parallel processing by CPU with many cores. Then, there is a Cell Broadband Engine (Cell) that specializes in the parallel processing. It experiments on this parallel search by using Cell. The search that uses Cell has not had the example. The algorithm of making to the parallel uses the existing one. But, it is examined whether Cell is effective to a parallel search. Finally, it mounts on the Japanese chess program, and experiments the chance of success of the play.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"155","bibliographic_titles":[{"bibliographic_title":"ゲームプログラミングワークショップ2007論文集"}],"bibliographicPageStart":"152","bibliographicIssueDates":{"bibliographicIssueDate":"2007-11-09","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"12","bibliographicVolumeNumber":"2007"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:44:08.414907+00:00","updated":"2025-01-21T12:47:05.707902+00:00"}