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

2022/08/29 by Koki Suetsugu, Suetsugu, Koki · 1 citation
Computer Science · #Artificial Intelligence in Games

paper · pdf · doi:10.48550/arxiv.2208.13403

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 ⋅ 10¹² and 10⁴³⁴, respectively. In this study, we improve the lower bound to 10^28.2 and the upper bound to 4.0 ⋅ 10¹⁸⁴, respectively.

Cited by

• Constructing All Birthday 3 Games as Digraphs

Related

• Constructing All Birthday 3 Games as Digraphs
• The Four Number Game
• A number game reconciliation
• Simple and tight complexity lower bounds for solving Rabin games
• Playability and arbitrarily large rat games