{"created":"2025-01-19T01:24:47.901803+00:00","updated":"2025-01-19T12:51:16.488497+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00225286","sets":["1164:5305:11215:11216"]},"path":["11216"],"owner":"44499","recid":"225286","title":["「タングラム」を解く新しいアルゴリズムの開発"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-03-10"},"_buckets":{"deposit":"b81f5f9a-69cb-4b4a-a321-b05f17b490c3"},"_deposit":{"id":"225286","pid":{"type":"depid","value":"225286","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"「タングラム」を解く新しいアルゴリズムの開発","author_link":["595798","595800","595799"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"「タングラム」を解く新しいアルゴリズムの開発"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"不完全情報ゲームとパズル","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2023-03-10","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"福島工業高等専門学校電気電子システム工学科"},{"subitem_text_value":"福島工業高等専門学校電気電子システム工学科"},{"subitem_text_value":"福島工業高等専門学校電気電子システム工学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Electrical and Electronic System Engineering, National Institute Technology, Fukushima College","subitem_text_language":"en"},{"subitem_text_value":"Department of Electrical and Electronic System Engineering, National Institute Technology, Fukushima College","subitem_text_language":"en"},{"subitem_text_value":"Department of Electrical and Electronic System Engineering, National Institute Technology, Fukushima College","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/225286/files/IPSJ-GI23049025.pdf","label":"IPSJ-GI23049025.pdf"},"date":[{"dateType":"Available","dateValue":"2025-03-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GI23049025.pdf","filesize":[{"value":"1.8 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":"18"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"89c962df-9499-475e-9f16-e3b2287a19c1","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 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":[{}]},{"creatorNames":[{"creatorName":"大槻, 正伸"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11362144","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-8736","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"タングラムとはピースと呼ばれる指定されたいくつかの図形を並べてシルエットと呼ばれる図形と同じ形を作るパズルである．タングラムでは各ピースをどのように移動させるかを表す移動量，回転量の組み合わせが無数にあるためコンピュータで解く効率の良いと思われるアルゴリズムはまだ見つかっていない．そこでタングラムのパズルの特性に注目することで既知のタングラムを解くアルゴリズムを改良しより良いアルゴリズムの開発を試みた．その結果，従来のプログラムと比較して倍以上の速度でタングラムを解くことが可能なプログラムを作成することができた．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告ゲーム情報学（GI）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-03-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"25","bibliographicVolumeNumber":"2023-GI-49"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":225286,"links":{}}