{"updated":"2025-01-21T12:47:55.494657+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00097635","sets":["6164:6165:6210:7366"]},"path":["7366"],"owner":"11","recid":"97635","title":["Hex の必勝手順に対する新証明技法とその応用"],"pubdate":{"attribute_name":"公開日","attribute_value":"2006-11-10"},"_buckets":{"deposit":"b9c3a3cb-bfb6-4020-acbb-21c894d10ac8"},"_deposit":{"id":"97635","pid":{"type":"depid","value":"97635","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Hex の必勝手順に対する新証明技法とその応用","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Hex の必勝手順に対する新証明技法とその応用"},{"subitem_title":"New Proof Techniques and Their Applications to Winning Strategies in Hex","subitem_title_language":"en"}]},"item_type_id":"18","publish_date":"2006-11-10","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":"電気通信大学情報工学専攻"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, The University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, The University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, The University of Electro-Communications","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/97635/files/IPSJ-GPWS2006019.pdf"},"date":[{"dateType":"Available","dateValue":"2006-11-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GPWS2006019.pdf","filesize":[{"value":"261.6 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":"0a56c88b-f4cb-430d-baf3-08cb45f7923b","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2006 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"三島, 健"},{"creatorName":"櫻井, 英俊"},{"creatorName":"野下浩平"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Mishima, Ken","creatorNameLang":"en"},{"creatorName":"Sakurai, Hidetoshi","creatorNameLang":"en"},{"creatorName":"Noshita, Kohei","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":"ゲームHexは、先手必勝手順の存在が証明されているが、具体的な必勝手順を示すことは長年の研究課題である。本稿では、石の連結性を定義するための新しい概念として、δ連結を提案し、それに基づいて、連結に関与する領域を拡張するための新しい技法δ拡張を導入する。この技法の応用として、従来の技法で記述するには複雑すぎるとされていた8×8盤面の初手63 に対する必勝手順を示す。また、この技法の強力さを示す例として、8×8盤面の初手54 に対する野下の必勝手順(2005)を大幅に簡単化する。同様にして、9×9 盤面に対する必勝手順を示すことができるが、本稿ではその証明木を示す（現在細部のチェック中）。","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In the game of Hex, it has been proved existentially that the first player always wins. Constructing a winning strategy has been a long-standing research problem. We present a new notion named δ-connection which defines a certain type of connections between stones. Based on it, we introduce a new technique named δ-extension for extending the area of empty cells which supports a desired union-connection. We apply our new techniques to show a winning strategy for the 8×8 board with the first move at 63, whose proof has been regarded as intractable by previous techniques. For demonstrating the power of our techniques, we show a winning strategy for 8×8 (first at 54) which is a considerable simplification of Noshita's one (2005). Finally we present a proof-tree of our winning strategy for 9×9 (first at 55), though the details of the proof are now being checked.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"142","bibliographic_titles":[{"bibliographic_title":"ゲームプログラミングワークショップ2006論文集"}],"bibliographicPageStart":"136","bibliographicIssueDates":{"bibliographicIssueDate":"2006-11-10","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2006"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:44:06.397800+00:00","id":97635,"links":{}}