Improving upper and lower bounds of the number of games born by day 4

Abstract

In combinatorial game theory, the lower and upper bounds of the number of games born by day 4 have been recognized as 3.0 · 1012 and 10434, respectively. In this study, we improve the lower bound to 1028.2 and the upper bound to 4.0 · 10184, respectively.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…