von Neumann's Dream - Solving Heads-up limit Texas hold'em poker
Abstract
Chess has long served as the measure of progress for artificial intelligence. However, at the very beginning of computing and artificial intelligence, John von Neumann dreamt of a different game: "Real life is not like... [ view full abstract ]
Chess has long served as the measure of progress for artificial intelligence. However, at the very beginning of computing and artificial intelligence, John von Neumann dreamt of a different game: "Real life is not like [chess]. Real life consists of bluffing, of little tactics of deception, of asking yourself what is the other man going to think I mean to do. And that is what games are about in my theory.” The game von Neumann hinted at is poker, and it played a foundational role in his formalization of game theory. Shortly after launching the field of game theory, he practically abandoned his new discipline to focus on the budding field of computing. He saw computers as the way to make his mathematics workable. Now, over 70 years later with both significant advances in computing and game theoretic algorithms, von Neumann's dream is now a reality. As announced in our paper in Science, Heads-up limit Texas hold'em poker, the smallest variant of poker played by humans, is essentially solved. In this talk, I will discuss how we accomplished this landmark result, along with the substantial scientific advances in our failed attempts along the way.
Authors
-
Michael Bowling
(University of Alberta)
Topic Area
Advanced Research Computing (ARC): ARC applications in any discipline (i.e. the sciences,
Session
HPC1.2.3 » ARC: Artificial Intelligence & Machine Learning (13:15 - Monday, 20th June, CCIS 1-140)
Presentation Files
The presenter has not uploaded any presentation files.