2000 character limit reached
Playability and arbitrarily large rat games (1705.03061v2)
Published 8 May 2017 in math.CO
Abstract: In 1973 Fraenkel discovered interesting sequences which split the positive integers. These sequences became famous, because of a related unsolved conjecture. Here we construct combinatorial games, with `playable' rulesets, with these sequences constituting the winning positions for the second player. Keywords: Combinatorial game, Fraenkel's conjecture, Impartial game, Normal play, Playability, Rational modulus, Splitting sequences
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.