arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.01724cs.AI
收藏

DeepStack:专家级人工智能在无限制扑克

DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker

University of Alberta(阿尔伯塔大学);Charles University(查理大学);Czech Technical University(捷克技术大学)

Matej Moravčík, Martin Schmid, Neil Burch, Viliam Lisý, Dustin Morrill, Nolan Bard, Trevor Davis, Kevin Waugh, Michael Johanson, Michael Bowling

摘要:

近年来,人工智能取得了多项突破,而游戏往往是其中的里程碑。这些博弈的一个共同特点是参与者拥有完美的信息。扑克是典型的不完全信息博弈,也是人工智能中一个长期存在的挑战性问题。我们引入DeepStack,这是一种用于不完美信息设置的算法。它结合了递归推理来处理信息不对称,分解将计算集中在相关决策上,以及使用深度学习从自我游戏中自动学习的直觉形式。在一项涉及44,000手扑克的研究中,DeepStack在无限制德州扑克中击败了具有统计学意义的专业扑克玩家。该方法在理论上是合理的,并被证明比以前的方法更难利用的策略。

英文摘要:

Artificial intelligence has seen several breakthroughs in recent years, with games often serving as milestones. A common feature of these games is that players have perfect information. Poker is the quintessential game of imperfect information, and a longstanding challenge problem in artificial intelligence. We introduce DeepStack, an algorithm for imperfect information settings. It combines recursive reasoning to handle information asymmetry, decomposition to focus computation on the relevant decision, and a form of intuition that is automatically learned from self-play using deep learning. In a study involving 44,000 hands of poker, DeepStack defeated with statistical significance professional poker players in heads-up no-limit Texas hold'em. The approach is theoretically sound and is shown to produce more difficult to exploit strategies than prior approaches.

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

↑