Journal of Information Processing
Online ISSN : 1882-6652
ISSN-L : 1882-6652
 
LR-ending Partisan Rulesets
Hiroki Inazu, Shun-ichi Kimura, Koki Suetsugu
Author information
JOURNAL FREE ACCESS

2026 Volume 34 Pages 1106-1114

Details
Abstract

In this paper, we consider LR-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 LR-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 LR-ending partisan rulesets and show how our results can be used for analyzing the rulesets.

Content from these authors
© 2026 by the Information Processing Society of Japan
Previous article Next article
feedback
Top