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 c d o t 1 0^{12}

and

1 0^{434}

, respectively. In this study, we improve the lower bound to

1 0^{28.2}

and the upper bound to

4.0 c d o t 1 0^{184}

, respectively.

This page was built for publication: Improving upper and lower bounds of the number of games born by day 4