Measuring the Size of Large No-Limit Poker Games
Measuring the Size of Large No-Limit Poker Games
复制标题
测量大型无限注扑克游戏的规模
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Michael Bradley Johanson
中科院分区：
文献类型：
--
作者：
Michael Bradley Johanson
在计算博弈论的领域中，博弈经常根据其规模进行比较。这可以通过几种方式来衡量，包括独特游戏状态的数量、决策点的数量以及所有决策点上的法律的行动的总数。这些数字要么是已知的，要么是对国际象棋和跳棋等各种经典游戏的估计。在随机和不完全信息的扑克游戏中，这些大小在限制玩家可用行动的极限游戏中很容易计算，但到目前为止，只对更复杂的情况进行了估计。
o限制”变体。本文描述了一种快速计算两人无限制扑克游戏规模的简单算法，给出了该算法的一个实现，并首次给出了年度计算机扑克比赛中无限制扑克游戏的游戏状态数、信息集数、动作数和终端节点数的精确计数。
In the eld of computational game theory, games are often compared in terms of their size. This can be measured in several ways, including the number of unique game states, the number of decision points, and the total number of legal actions over all decision points. These numbers are either known or estimated for a wide range of classic games such as chess and checkers. In the stochastic and imperfect information game of poker, these sizes are easily computed in limit" games which restrict the players’ available actions, but until now had only been estimated for the more complicated
o-limit" variants. In this paper, we describe a simple algorithm for quickly computing the size of two-player no-limit poker games, provide an implementation of this algorithm, and present for the rst time precise counts of the number of game states, information sets, actions and terminal nodes in the no-limit poker games played in the Annual Computer Poker Competition.