EDMONTON, Alberta, Jan. 8 (UPI) — Scientists in Canada created an algorithm that solves Texas Hold ‘Em Poker, making their computer program essentially unbeatable.
The computer comes so close to a perfect hand of two-player, fixed-limit, heads-up Texas Hold ‘Em, that statistically speaking, it can’t be beaten within a human lifetime of playing poker, {link:a study in Science journal said: “http://www.sciencemag.org/content/347/6218/145.abstract”,nw}.
Researchers at the Univeristy of Alberta programmed a computer to play 24 trillion hands of poker each second for two months so that it could learn to play all possibilities of the game by “regretting” previous poor decisions.
“Our model has spent two months playing poker again and again,” {link:lead researcher Michael Bowling said: “http://www.bbc.co.uk/news/science-environment-30718558″,nw}. “That’s more poker hands than all of humanity — so in some sense it’s not surprising that it has developed the perfect strategy.”
Comment count on this article reflects comments made on Breitbart.com and Facebook. Visit Breitbart's Facebook Page.