$\mathcal{L}\mathcal{R}$-Ending partisan rulesets

Abstract

In this paper, we consider $\mathcal{L}\mathcal{R}$-ending partisan rulesets as a branch of combinatorial game theory. In these rulesets, the sets of options of both players are the same. However, there are two kinds of terminal positions. If the game ends in one kind of terminal position, then a player wins, and if the game ends in the other kind of terminal position, the other player wins. We introduce notations for positions in $\mathcal{L}\mathcal{R}$-ending partisan rulesets including disjunctive sum of terminal positions depending on the parity and basic definitions and show their algebraic structures. We also introduce some examples of $\mathcal{L}\mathcal{R}$-ending partisan rulesets and show how our results can be used for analyzing the rulesets.

20 pages. Accepted for publication in Journal of Information Processing