{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00238712","sets":["6164:6165:7308:11764"]},"path":["11764"],"owner":"44499","recid":"238712","title":["全消しできるさめがめパズルにおける難易度に関する考察"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-08-26"},"_buckets":{"deposit":"5ad40582-08ef-4020-ac0d-3788734cd51b"},"_deposit":{"id":"238712","pid":{"type":"depid","value":"238712","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"全消しできるさめがめパズルにおける難易度に関する考察","author_link":["653804"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"全消しできるさめがめパズルにおける難易度に関する考察"}]},"item_type_id":"18","publish_date":"2024-08-26","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"千葉工業大学工学部情報通信システム工学科"}]},"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/238712/files/IPSJ-EC2024023.pdf","label":"IPSJ-EC2024023.pdf"},"date":[{"dateType":"Available","dateValue":"2024-08-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-EC2024023.pdf","filesize":[{"value":"1.5 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"40"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"f8abfc92-5f50-4035-9b7a-62a44de0a2f8","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"三浦, 元喜"}],"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":"さめがめは，上下左右に隣接した同じ色のブロックを選択することによって，画面から消していく形式のコンピュータパズルゲームである．一般的に盤面はランダムに生成されることが多いが，盤面によって難易度が異なることが知られている．また小さい盤面では全消しできない場合も少なくないことが知られている．我々は，全消しを目的とするさめがめパズルの難易度を定量的に見積もる方法として，ブロックが消される際の対応関係と，それらのブロックの離散状態を数値化する指標を考案した．人間のプレイデータに基づくクリア率との相関を調べたところ，提案指標は全消しできる選択候補の割合（全消し率）よりも比較的高い値となり，難易度を見積もるうえで有効な指標になりうることがわかった．","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"152","bibliographic_titles":[{"bibliographic_title":"エンタテインメントコンピューティングシンポジウム2024論文集"}],"bibliographicPageStart":"149","bibliographicIssueDates":{"bibliographicIssueDate":"2024-08-26","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":238712,"updated":"2025-01-19T08:30:57.236416+00:00","links":{},"created":"2025-01-19T01:41:55.517173+00:00"}