Estimates for the Branching Factors of Atari Games
Not on the map. Why?
Abstract (arXiv)
The branching factor of a game is the average number of new states reachable from a given state. It is a widely used metric in AI research on board games, but less often computed or discussed for videogames. This paper provides estimates for the branching factors of 103 Atari 2600 games, as implemented in the Arcade Learning Environment (ALE). Depending on the game, ALE exposes between 3 and 18 available actions per frame of gameplay, which is an upper bound on branching factor. This paper shows, based on an enumeration of the first 1 million distinct states reachable in each game, that the average branching factor is usually much lower, in many games barely above 1. In addition to reporting the branching factors, this paper aims to clarify what constitutes a distinct state in ALE.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 1 of its 9 references that are in the map. First posted on arXiv 6 Jul 2021.
Builds on
1 of 9 references.
References · 1
Built on by
Citing papers per year: 2022: 2.
2 papers.
- 2022The Phenomenon of Policy Churncited by 28
- 2022Game State Learning via Game Scene Augmentationcited by 2
- 2022Game State Learning via Game Scene Augmentation4 Jul 2022
- 2022The Phenomenon of Policy Churn1 Jun 2022