2022/01/16 by Koki Suetsugu, Suetsugu, Koki
Computer Science · #Artificial Intelligence in Games #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.2201.06069
openalex publication_date 2022/01/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In Combinatorial Game Theory, we study the set of games G, whose elements are mapped from positions of rulesets. In many case, given a ruleset, not all elements of G can be given as a position in the ruleset. It is an intriguing question what kind of ruleset would allow all of them to appear. In this paper, we introduce a ruleset named turning tiles and prove the ruleset is a universal partizan ruleset, that is, every element in G can occur as a position in the ruleset. This is the second universal partizan ruleset after generalized konane.