Home Mathematics Playing Bynum’s game cautiously
Chapter
Licensed
Unlicensed Requires Authentication

Playing Bynum’s game cautiously

  • L. R. Haff
Become an author with De Gruyter Brill
Combinatorial Game Theory
This chapter is in the book Combinatorial Game Theory

Abstract

Several sequences of infinitesimals are introduced for the purpose of analyzing a restricted form of Bynum’s game or “Eatcake”. Two of these have terms with uptimal values (à la Conway and Ryba, the 1970s). All others (eight) are specified by “uptimal+ forms,” i. e., standard uptimals plus a fractional uptimal. The game itself is played on an n × m grid of unit squares, and here we describe all followers (submatrices) of the 12 × 12 grid. Positional values of larger grids become intractable. However, an examination of n × n squares, 2 ≤ n ≤ 21, reveals that all but three of them are equal to ∗, the exceptions being the 10×10, 14×14, and 18×18 cases. Nonetheless, the exceptional cases have “star-like” characteristics: they are of the form ±(G), confused with both zero and up, and less than double-up.

Abstract

Several sequences of infinitesimals are introduced for the purpose of analyzing a restricted form of Bynum’s game or “Eatcake”. Two of these have terms with uptimal values (à la Conway and Ryba, the 1970s). All others (eight) are specified by “uptimal+ forms,” i. e., standard uptimals plus a fractional uptimal. The game itself is played on an n × m grid of unit squares, and here we describe all followers (submatrices) of the 12 × 12 grid. Positional values of larger grids become intractable. However, an examination of n × n squares, 2 ≤ n ≤ 21, reveals that all but three of them are equal to ∗, the exceptions being the 10×10, 14×14, and 18×18 cases. Nonetheless, the exceptional cases have “star-like” characteristics: they are of the form ±(G), confused with both zero and up, and less than double-up.

Downloaded on 17.12.2025 from https://www.degruyterbrill.com/document/doi/10.1515/9783110755411-012/html?lang=en
Scroll to top button