Nature "An 'essentially unbeatable' algorithm for the popular card game points to strategies for solving real-life problems without having complete information." by Philip Ball
'A new computer algorithm can play one of the most popular variants of
poker essentially perfectly. Its creators say that it is virtually
“incapable of losing against any opponent in a fair game”.
'This is a step beyond a computer program that can beat top human
players, as IBM's chess-playing computer Deep Blue famously did in 1997
against Garry Kasparov, at the time the game's world champion. The poker
program devised by computer scientist Michael Bowling and his
colleagues at the University of Alberta in Edmonton, Canada, along with
Finnish software developer Oskari Tammelin, plays perfectly, to all
intents and purposes.
'That means that this
particular variant of poker, called heads-up limit hold’em (HULHE), can
be considered solved. The algorithm is described in a paper in Science1.
strategy the authors have computed is so close to perfect “as to render
pointless further work on this game”, says Eric Jackson, a
computer-poker researcher based in Menlo Park, California.
'“I think that it will come as a surprise to experts that a game this big has been solved this soon,” Jackson adds.'