Heads-up limit hold'em poker is solved

被引:280
作者
Bowling, Michael [1 ]
Burch, Neil [1 ]
Johanson, Michael [1 ]
Tammelin, Oskari
机构
[1] Univ Alberta, Dept Comp Sci, Edmonton, AB T6G 2E8, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
GAMES;
D O I
10.1126/science.1259433
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
070301 [无机化学]; 070403 [天体物理学]; 070507 [自然资源与国土空间规划学]; 090105 [作物生产系统与生态工程];
摘要
Poker is a family of games that exhibit imperfect information, where players do not have full knowledge of past events. Whereas many perfect-information games have been solved (e. g., Connect Four and checkers), no nontrivial imperfect-information game played competitively by humans has previously been solved. Here, we announce that heads-up limit Texas hold'em is now essentially weakly solved. Furthermore, this computation formally proves the common wisdom that the dealer in the game holds a substantial advantage. This result was enabled by a new algorithm, CFR+, which is capable of solving extensive-form games orders of magnitude larger than previously possible.
引用
收藏
页码:145 / 149
页数:5
相关论文
共 45 条
[1]
Allis V., 1988, THESIS VRIJE U BRUSS
[2]
Allis V. L., 1994, THESIS U LUMBURG
[3]
[Anonymous], 2007, ECONOMIST, P31
[4]
[Anonymous], 2008, ADV NEURAL INFORM PR
[5]
Babbage C., 1864, PASSAGES LIFE PHILOS
[6]
The challenge of poker [J].
Billings, D ;
Davidson, A ;
Schaeffer, J ;
Szafron, D .
ARTIFICIAL INTELLIGENCE, 2002, 134 (1-2) :201-240
[7]
Billings D., 2003, IJCAI: Proceedings of the 18th International Joint Conference on Artificial Intelligence, V3, P661
[8]
Borel E, 1938, APPL THEORIE PROBABI
[9]
Bowling Michael., 2008, Proceedings of the 25th International Conference on Machine Learning (ICML?08), P72
[10]
Bronowski J., 1973, The Ascent of Man