{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00232898","sets":["1164:5305:11555:11556"]},"path":["11556"],"owner":"44499","recid":"232898","title":["クラスPに属する全象なルールセット"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-01"},"_buckets":{"deposit":"c903b032-8a8f-4279-9909-6b33999001eb"},"_deposit":{"id":"232898","pid":{"type":"depid","value":"232898","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"クラスPに属する全象なルールセット","author_link":["631481","631482"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"クラスPに属する全象なルールセット"},{"subitem_title":"Universal Rulesets in P","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2024-03-01","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋大学大学院情報学研究科"},{"subitem_text_value":"名古屋大学大学院情報学研究科"}]},"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/232898/files/IPSJ-GI24051010.pdf","label":"IPSJ-GI24051010.pdf"},"date":[{"dateType":"Available","dateValue":"2026-03-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GI24051010.pdf","filesize":[{"value":"1.0 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":"f051f847-cfe0-4674-807d-23cb3df8910e","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":[{}]}]},"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":"コンウェイの正規形有限ゲームにおいて，あるルールセットが任意のゲーム値を表現できるとき全象であるといい，その性質を全象性と呼ぶ．あるルールセットが全象であるならばゲームの表現の意味で最も複雑であると言える．一方，別の「複雑性」の指標として必勝判定問題の計算複雑性があり，この方面からの研究が理論計算機科学分野で盛んにおこなわれている．これまで多くの組合せゲーム（コンウェイの有限ゲームを含む）の必勝判定問題が PSPACE 困難などの計算困難なクラスに属することが示されているのに対し，全象であることがわかっているルールセットは，（いずれも必勝判定問題が PSPACE 完全である）一般化コナネ，タイル返し，Go on lattice，扉の向こうへ，の 4 つに限られており，必勝判定問題の計算複雑性と全象性の関係が注目されている．本研究では多項式時間で必勝判定が可能である全象ゲームが存在することを示す．具体的には，木かつグリッドに埋め込み可能なグラフに制限しても非不偏ゲーム版の一般化しりとりが全象であることを示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In combinatorial game theory, a ruleset is universal if it can represent any game value in the short Conway group. Universal rule sets are sufficiently complex that they may have important implications in the analysis of game values. Another well-studied concept of “complexity” of a ruleset is the computational complexity. In the field of theoretical computer science, many rulesets are shown to be computationally hard, such as NP-hard or PSPACE-hard, regarding the winner determination. Such hard rulesets include all rulesets currently known to be universal, i.e., GENERALIZED KONANE, TURNING TILES, GO ON LATTICE, and BEYOND THE DOOR. The fact raises a natural question: Is the winner-determination problem of every universal ruleset computationally hard (or not)? This paper answers the question by finding new universal rulesets whose winner determination problems belong to P, i.e., the class of the problems solvable in polynomial time. Specifically, we show that all partisan variants of GENERALIZED GEOGRAPHY proposed by Bosboom et al., whose winner determinations are shown to be P, are universal even if the input graph is a tree embeddable in a grid.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告ゲーム情報学（GI）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"10","bibliographicVolumeNumber":"2024-GI-51"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T10:17:06.562780+00:00","created":"2025-01-19T01:34:01.964071+00:00","id":232898}