Summary: 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, 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 \times m\) grid of unit squares, and here we describe all followers (submatrices) of the \(12 \times 12\) grid. Positional values of larger grids become intractable. However, an examination of \(n \times n\) squares, \(2 \leq n \leq 21\), reveals that all but three of them are equal to \(\ast \), the exceptions being the \(10\times10\), \(14\times14\), and \(18\times18\) cases. Nonetheless, the exceptional cases have “star-like” characteristics: they are of the form \(\pm (G)\), confused with both zero and up, and less than double-up.