{"updated":"2025-01-21T12:51:46.671738+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00097526","sets":["6164:6165:6210:7362"]},"path":["7362"],"owner":"11","recid":"97526","title":["しりとりゲームのNP困難性"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-11-15"},"_buckets":{"deposit":"f252b385-f6a7-4e29-9ce1-04c393a9b4e9"},"_deposit":{"id":"97526","pid":{"type":"depid","value":"97526","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"しりとりゲームのNP困難性","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"しりとりゲームのNP困難性"},{"subitem_title":"NP-hardness of Word Chain Games","subitem_title_language":"en"}]},"item_type_id":"18","publish_date":"2002-11-15","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学情報基盤センター"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Information Technology Center, University of Tokyo","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/97526/files/IPSJ-GPWS2002021.pdf"},"date":[{"dateType":"Available","dateValue":"2002-11-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GPWS2002021.pdf","filesize":[{"value":"209.7 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":"4b10b2d1-fe7d-48bd-b8cc-f5ddd7a1ddc6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 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":"Tanaka, Tetsuro","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":"「しりとりゲーム」はしりとりを完全情報化して定義したゲームである．完全情報ゲームなので，使用可能な文字の種類，使用可能な単語の集合と開始文字を決めれば，勝敗は決定可能である．「しりとりゲーム」の勝敗に関してはグラフとして表現した時に勝敗が同じで辺の少ないグラフに簡約する方法，文字の種類をnとしたとき，n=3までは定数時間で勝敗を決定可能であることが分かっているが，nを増やしていったときに，効率的に勝敗を決定するアルゴリズムがあるかは分かっていなかった．本論文では，しりとりゲームの勝敗の決定問題が文字の種類nに対してNP困難であることを示した．これにより，文字の種類によらずに，しりとりゲームの勝敗を効率的に求めるプログラムを書くのが困難であることが分かる．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The word-chain game (SHIRITORI in Japanese) in which two players are assumed to know all the words can be modeled as a game on graph. When given a set of words with a word to start, it is theoretically possible to decide whether the first player can win the game or not because it is a game with perfect information. As the alphabet size become bigger, problems become more difficult. In this paper, we show that problem is NP-hard.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"142","bibliographic_titles":[{"bibliographic_title":"ゲームプログラミングワークショップ2002論文集"}],"bibliographicPageStart":"140","bibliographicIssueDates":{"bibliographicIssueDate":"2002-11-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"17","bibliographicVolumeNumber":"2002"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:44:00.884093+00:00","id":97526,"links":{}}