首页> 外文会议>European Conference on Artificial Intelligence >Adaptive play in Texas Hold'em Poker
【24h】

Adaptive play in Texas Hold'em Poker

机译:德克萨斯州举行的自适应戏剧扑克

获取原文

摘要

We present a Texas Hold'em poker player for limit heads-up games. Our bot is designed to adapt automatically to the strategy of the opponent and is not based on Nash equilibrium computation. The main idea is to design a bot that builds beliefs on his opponent's hand. A forest of game trees is generated according to those beliefs and the solutions of the trees are combined to make the best decision. The beliefs are updated during the game according to several methods, each of which corresponding to a basic strategy. We then use an exploration-exploitation bandit algorithm, namely the UCB (Upper Confidence Bound), to select a strategy to follow. This results in a global play that takes into account the opponent's strategy, and which turns out to be rather unpredictable. Indeed, if a given strategy is exploited by an opponent, the UCB algorithm will detect it using change point detection, and will choose another one. The initial resulting program, called Brennus, participated to the AAAI'07 Computer Poker Competition in both online and equilibrium competition and ranked eight out of seventeen competitors.
机译:我们展示了一个德克萨斯州扑克扑克玩家,用于限制抬头游戏。我们的机器人旨在自动适应对手的策略,而不是基于纳什均衡计算。主要思想是设计一个在对手的手上建立信仰的机器人。根据那些信念产生的游戏树木,树木的解决方案组合以制造最佳决定。根据几种方法在游戏期间更新信念,每个方法对应于基本策略。然后,我们使用探索开发强盗算法,即UCB(上置信界限),选择要遵循的策略。这导致全球戏剧考虑到对手的策略,这结果表明是相当不可预测的。实际上,如果对对手利用给定的策略,则UCB算法将使用更改点检测来检测它,并选择另一个。初始导致的计划,称为Brennus,参加了在线和均衡竞争中的AAAI'07计算机扑克竞赛,并在十七次竞争对手中排名八。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号