Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cyclic impartial games with carry-on moves

Published 16 Dec 2025 in math.CO | (2512.14466v1)

Abstract: In an impartial combinatorial game, both players have the same options in the game and all its subpositions. The classical Sprague-Grundy Theory was developed for short impartial games, where players have a finite number of options, there are no special moves, and an infinite run is not possible. Subsequently, many generalizations have been proposed, particularly the Smith-Frankel-Perl Theory devised for games where the infinite run is possible, and the Larsson-Nowakowski-Santos Theory able to deal with entailing moves that disrupt the logic of the disjunctive sum. This work presents a generalization that combines these two theories, suitable for analyzing cyclic impartial games with carry-on moves, which are particular cases of entailing moves where the entailed player has no freedom of choice in their response. This generalization is illustrated with sc green-lime hackenbush, a game inspired by the classic green hackenbush.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.