Playability and arbitrarily large rat games
classification
🧮 math.CO
keywords
sequencescombinatorialconjecturefraenkelgamegamesplayabilityarbitrarily
read the original 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
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.