完美信息
利用
计算机科学
不完美的
人工智能
直觉
计算
极限(数学)
机器学习
认知科学
数理经济学
算法
数学
心理学
哲学
计算机安全
数学分析
语言学
作者
Matej Moravčík,Martin Schmid,Neil Burch,Viliam Lisý,Dustin Morrill,Nolan Bard,Trevor Davis,Kevin Waugh,Michael Johanson,Michael Bowling
出处
期刊:Science
[American Association for the Advancement of Science (AAAS)]
日期:2017-03-03
卷期号:356 (6337): 508-513
被引量:740
标识
DOI:10.1126/science.aam6960
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI