{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00241018","sets":["1164:2592:11452:11789"]},"path":["11789"],"owner":"44499","recid":"241018","title":["YOMENの最適質問数"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-11-19"},"_buckets":{"deposit":"1460f958-781e-4cf0-8f31-81c3a72956b6"},"_deposit":{"id":"241018","pid":{"type":"depid","value":"241018","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"YOMENの最適質問数","author_link":["662845","662847","662844","662846"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"YOMENの最適質問数"},{"subitem_title":"The Optinum Question Number on YOMEN","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2024-11-19","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋大学"},{"subitem_text_value":"大阪公立大学"},{"subitem_text_value":"九州大学"},{"subitem_text_value":"名古屋大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Osaka Metropolitan University","subitem_text_language":"en"},{"subitem_text_value":"Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Nagoya 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/241018/files/IPSJ-AL24200002.pdf","label":"IPSJ-AL24200002.pdf"},"date":[{"dateType":"Available","dateValue":"2026-11-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL24200002.pdf","filesize":[{"value":"147.7 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":"54f8d420-64f5-42d1-b3bb-27f0c1a6e828","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 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":[{}]},{"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":"「YOMEN」は，2020 年発売の 3 次元のコード (配置) を質問によって推測する 2 人用 3 次元コード推理型ゲームである．コード推理型ゲームとは，プレイヤーがコード作成者 (code maker) とコード解読者 (code breaker) となり，それぞれのゲームに応じた方法でコード解読者が，コード作成者の定めた「コード」を推測するゲームである．YOMEN ではルールに準拠して 3 × 3 のマス上に置かれた 3 つの色付きブロックの配置 (本研究ではこれを合法配置という) をコードする．また，お互いのプレイヤーがコード作成者，コード解読者の両方となり，側面景色，上面景色という 2 種類の質問を用いて，質問に対する返答から相手プレイヤーの定めたコードを推測することを目的としてゲームを進行する．本研究では YOMEN における 2 人のプレイヤーをそれぞれコード解読者，作成者のうちどちらかのみの役割となるとし，そのときコード解読者がコード作成者の作成したコードを探り当てるためには何回の質問が必要であるのかについて研究を行う．YOMEN において存在し得る合法配置の数，また任意の合法配置を一意に絞り込むために必要となる質問数について考察し，YOMEN における合法配置数が 19272 であること，最適質問数が 7 であることを示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"YOMEN is a 2-player 3D code-breaking game released in 2020. A code-breaking game is a game in which two players play as a code maker or a code breaker, and the code breaker tries to find the code defined by the code maker in a way appropriate to each game. In YOMEN, a code is an arrangement of three blocks colored in red, yellow, or black on 3 × 3 cells, so that it satisfies certain rules. The code breaker can ask two types of questions, called side view about a row or column and top view about a cell. In the formal rule of YOMEN, both players act as a code maker and a code breaker, and try to find the opponent's code, whereas we focus on the role of the code breaker for a given code in this study. We study how many questions a code breaker needs to ask to identify an arbitrary code given by the code maker; we call the minimum number of questions required to identify an arbitrary legal arrangement the optimal question number. Our results are (1) the total number of legal arrangements in YOMEN is 19272, and (2) the optimal question number for YOMEN is 7.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"3","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-11-19","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"2024-AL-200"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T07:46:12.937748+00:00","created":"2025-01-19T01:45:32.531577+00:00","id":241018}