arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.02385cs.AI
收藏

Atari游戏分支因子的估计

Estimates for the Branching Factors of Atari Games

American University(美利坚大学)

Mark J. Nelson

摘要:

博弈的分支因子是从给定状态可到达的新状态的平均数。这是一个广泛用于棋盘游戏AI研究的指标,但在视频游戏中很少计算或讨论。本文提供了103雅达利2600游戏的分支因子的估计,在街机学习环境(ALE)中实现。根据游戏的不同,ALE会在每帧游戏中暴露3到18个可用动作,这是分支因子的上限。这篇论文显示,基于每个游戏中前100万个可达的不同状态的枚举,平均分支因子通常要低得多,在许多游戏中仅略高于1。除了报告的分支因子,本文的目的是澄清什么构成了一个独特的状态在ALE。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑