{"id":210291,"created":"2025-01-19T01:11:32.724861+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00210291","sets":["1164:2592:10486:10558"]},"path":["10558"],"owner":"44499","recid":"210291","title":["15パズルの変形とその最短手数の最大値に関する研究"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-10"},"_buckets":{"deposit":"3daccdda-8abe-4ac4-8638-2fc4b5efc22b"},"_deposit":{"id":"210291","pid":{"type":"depid","value":"210291","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"15パズルの変形とその最短手数の最大値に関する研究","author_link":["531917","531916"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"15パズルの変形とその最短手数の最大値に関する研究"},{"subitem_title":"Research on transformation of 15-puzzle and its maximum shortest moves","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2021-03-10","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":"School of Information Science, Japan Advanced Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"School of Information Science, Japan Advanced Institute of Science and Technology","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/210291/files/IPSJ-AL21182010.pdf","label":"IPSJ-AL21182010.pdf"},"date":[{"dateType":"Available","dateValue":"2023-03-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL21182010.pdf","filesize":[{"value":"750.4 kB"}],"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":"25d2b9d2-1b91-4be1-949c-33098e483457","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"佐藤, 隆太郎"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"上原, 隆平"}],"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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"スライディングブロックパズルの 1 つに，15 パズルと呼ばれるパズルがある．15 パズルは，4 × 4 のグリッドに，1 から 15 までの番号が書かれた 15 枚のタイルと 1 つの空きマスで構成される．このパズルの目的は，空きマスに隣接したタイルをスライドさせる操作を繰り返し行い，特定のタイルの配置に変化させることである．15 パズルのサイズは，4 × 4 から m × n に一般化することができる．n × n パズルの最短手数を求める問題は NP 困難であることが知られており，n についての最大の最短手数は分かっていない．本研究では，パズルの一方の長さを小さい値（m＝2）に制限した．そのような 2×n のサイズに対して，計算機を用いて特定の配置における手数や手順を計算し，n についての最大の最短手数の下界値と上界値について示した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The 15-puzzle is one of the sliding block puzzles. It consists of a grid of 4 × 4 with 15 tiles numbered from 1 to 15 and one blank space. The goal of this puzzle is to change arrangement of the tiles by repeatedly sliding a tile adjacent to the blank space. The 15-puzzle can be generalized from 4 × 4 to m× n. The problem of finding the shortest moves for an n2 - 1 puzzle is known to NP-hard, and the maximum shortest moves for n is not known. In this study, we limit the width of one side of the puzzle to a small value (m = 2). As a result, we show the lower and upper bounds of the maximum shortest moves for 2 × n.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"10","bibliographicVolumeNumber":"2021-AL-182"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T18:12:02.747999+00:00","links":{}}