{"id":31693,"updated":"2025-01-22T16:32:16.816587+00:00","links":{},"created":"2025-01-18T23:00:58.082084+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00031693","sets":["1164:2592:2600:2605"]},"path":["2605"],"owner":"1","recid":"31693","title":["六角格子，三角格子上でのスリザーリンクのASP完全性について"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-03-09"},"_buckets":{"deposit":"74c923e5-7b3d-4a6d-ad99-ed67a546a732"},"_deposit":{"id":"31693","pid":{"type":"depid","value":"31693","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"六角格子，三角格子上でのスリザーリンクのASP完全性について","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"六角格子，三角格子上でのスリザーリンクのASP完全性について"},{"subitem_title":"ASP-Completeness of the Slither Link Puzzle on Several Grids","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2007-03-09","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 Engineering Informatics, Osaka Electro-Communication University","subitem_text_language":"en"},{"subitem_text_value":"Department of Engineering Informatics, OsakaElectro-Communication University","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/31693/files/IPSJ-AL07111018.pdf"},"date":[{"dateType":"Available","dateValue":"2009-03-09"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL07111018.pdf","filesize":[{"value":"1.9 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":"ff07b212-9b24-4c4d-a91c-862be2e2fcf8","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2007 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":"Kosuke, NUKUI","creatorNameLang":"en"},{"creatorName":"Akihiro, UEJIMA","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":"パズルやゲームの面白さの源は，それらの持つ根源的な難しさにあり，これまで数多くのパズルやゲームの計算複雑さが解析されている．本稿では，ペンシルパズルの一種であるスリザーリンクの盤面を正k角格子状に一般化した，k‐スリザーリンクを提案し，k‐スリザーリンクの解の存在判定を問う問題のNP完全性を，制限付きハミルトン閉路問題からの多項式時間還元を用いて証明する．また，別解問題（ASP，Another Solution Problem，問題例とその1つの解が与えられたとき，他の解の有無を判定する問題）についても考察し，k‐スリザーリンクの別解問題について，そのNP完全性を示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A fundamental difficulty to solve games and puzzles seems to become the basis for interest factors of them, and the computational complexity of puzzle games have been investigated. This paper proposes k-Slither Link Puzzle, which is a generalization of the traditional Slither Link Puzzle concerning the grids. The puzzle is one of many popular pencil-and-paper puzzles on rectangular grids k = 4, we deal with the puzzles on all the rest of regular tessellations of the plane, i.e. triangular k = 3 and hexagonal grids k = 6. This paper presents the NP-completeness of k-Slither Link Puzzle for k = 3, 6.Moreover, the NP-completeness of ANOTHER SOLUTION PROBLEMS (ASP), which are problems to decide if there is some solution other than a given solution, of the puzzles is proved in this paper.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"136","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"129","bibliographicIssueDates":{"bibliographicIssueDate":"2007-03-09","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"23(2007-AL-111)","bibliographicVolumeNumber":"2007"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}