In combinatorial game theory, the lower and upper bounds of the number of games born by day $4$ have been recognized as $3.0 \cdot 10^{12}$ and $10^{434}$, respectively. In this study, we improve the lower bound to $10^{28.2}$ and the upper bound to $4.0 \cdot 10^{184}$, respectively.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。