New universal partizan rulesets and a new universal dicotic partisan ruleset
Koki Suetsugu

TL;DR
This paper introduces two new universal partizan rulesets, including a dicotic variant, and proves their universality using game tree preserving reduction, expanding the class of known universal partizan games.
Contribution
The paper presents two novel universal partizan rulesets and a dicotic version, demonstrating their universality through rigorous reduction techniques.
Findings
Two new universal partizan rulesets introduced
Proved universality using game tree preserving reduction
Established a universal dicotic partisan ruleset
Abstract
Universal partizan ruleset is a ruleset in which every game value of partizan games can be appear as a position. So far, generalized konane and turning tiles have been proved to be universal partizan rulesets. In this paper, we introduce two rulesets go on lattice and beyond the door and prove that they are universal partizan rulesets by using game tree preserving reduction. Further, we consider dicotic version of beyond the door, and we prove the ruleset is a universal partisan dicotic ruleset.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games
