Go Back   IceInSpace > General Astronomy > General Chat
Register FAQ Calendar Today's Posts Search

Reply
 
Thread Tools Rate Thread
  #1  
Old 07-03-2017, 04:32 PM
gary
Registered User

gary is offline
 
Join Date: Apr 2005
Location: Mt. Kuring-Gai
Posts: 5,999
Cool Chips are down - Texas Hold’em-playing AI running on modest hardware wins tournament

On 31st January 2017, it was reported that a supercomputer running
software developed at Carnegie Mellon University had won the
“Brains vs. Artificial Intelligence” heads-up, no-limit Texas Hold'em
tournament playing against four human poker pros. It won
by US $1,766,250 in chips over 120,000 hands.

Decades ago I saw a cartoon depicting two guys sitting at a bar
and one guy, looking depressed, was saying to the other,
"I could understand if I had been made redundant by an entire
computer, but I have been replaced by a single transistor".

Well the news today isn't quite that bad for human poker players,
but a new Texas Hold'em AI called DeepStack has emerged with
a fresh victory running on nothing more than the type of GPU chip
found in a home gaming desktop computer.

Quote:
Originally Posted by Jeremy Hsu, IEEE Spectrum
DeepStack proved its poker-playing prowess in 44,852 games played against 33 poker pros recruited by the International Federation of Poker from 17 countries. Typically researchers would need to have their computer algorithms play a huge number of poker hands to ensure that the results are statistically significant and not simply due to chance. But the DeepStack team used a low-variance technique called AIVAT that filters out much of the chance factor and enabled them to come up with statistically significant results with as few as 3,000 games.

“We have a history in group of doing variance reduction techniques,” Bowling explains. “This new technique was pioneered in our work to help separate skill and luck.”

Of all the players, 11 poker pros completed the requested 3,000 games over a period of four weeks from November 7 to December 12, 2016. DeepStack handily beat 10 of the 11 with a statistically significant victory margin, and still technically beat the 11th player.
Quote:
Originally Posted by Jeremy Hsu, IEEE Spectrum
Worried poker fans may have even greater cause for concern with the success of DeepStack. Unlike Libratus, DeepStack’s remarkably effective forward-looking intuition means it does not have to do any extra computing beforehand. Instead, it always looks forward by solving for actual possible plays several moves ahead and then relies on its intuition to approximate the rest of the game.

This “continual re-solving” approach that can take place at any given point in a game is a step beyond the “endgame solver” that Libratus used only during the last betting rounds of each game. And the fact that DeepStack’s approach works on the hardware equivalent of a gaming laptop could mean the world will see the rise of many more capable AI bots tackling a wide variety of challenges beyond poker in the near future.
Article at the Institute of Electrical and Electronic Engineers (IEEE) here -
http://spectrum.ieee.org/automaton/r...emolish-humans

Last edited by gary; 07-03-2017 at 05:03 PM.
Reply With Quote
  #2  
Old 07-03-2017, 10:49 PM
alpal's Avatar
alpal
Registered User

alpal is offline
 
Join Date: Jan 2012
Location: Melbourne
Posts: 3,784
Computers can already beat the best chess player easily -
so I'm not surprised.
Reply With Quote
  #3  
Old 08-03-2017, 12:04 AM
xelasnave's Avatar
xelasnave
Gravity does not Suck

xelasnave is offline
 
Join Date: Mar 2005
Location: Tabulam
Posts: 17,003
Well it will never win at blackjack cause it wont be allowed to count cards or they will break its legs.
How amazing.
Its sucess probably turns on not bluffing or being a le to be bluffed and the ability to work out percentages and not drinking during a game.
Alex
Reply With Quote
  #4  
Old 08-03-2017, 12:18 AM
gary
Registered User

gary is offline
 
Join Date: Apr 2005
Location: Mt. Kuring-Gai
Posts: 5,999
Quote:
Originally Posted by alpal View Post
Computers can already beat the best chess player easily -
so I'm not surprised.
The 1997 win by the IBM supercomputer, Deep Blue, against reigning
world chess champion, Garry Kasparov, was a major achievement.

However, the recent tournament wins by these new computers against
poker pros is significant for a couple of different reasons.

There is a field of mathematics known as Game Theory that was
pioneered by John von Neumann during the 20th century.

Now von Neumann was a genius by any measure of the word. A common
description given by the many contemporary mathematicians,
physicists, economists, engineers and bureaucrats who had dealings
with him was that he was the most brilliant person they ever met.

In 1944, von Neumann published a seminal book along with economist
Oskar Morgenstern entitled "Theory of Games and Economic Behaviour".

As von Neumann would tell people who asked him, within the
discipline of Game Theory, chess is not a game.

Chess, he would describe, is simply a well-defined form of computation.

Just like most of us by the age of 6 or 7 can master noughts-and-crosses -
that is we learn how to play to win or force a draw - there are, in theory,
a set of moves that one could make to always win or draw in chess.

As there are many more possible moves in chess than noughts-and-crosses
it makes the game exponentially more difficult and not even the greatest
master's know the precise set of moves to win or draw.

However, in chess, though you humanly may not be able to work out
the right move to make, for any position there exists an exact procedure.

Real games, von Neumann would describe, are like real life.
Real life consists of bluffing and tactics of deception and asking yourself
what the other man is going to think I mean to do.

So it is no surprise that in Von Neumann's mathematically-intense
book there is a chapter entitled "Poker and Bluffing".

The triumph for von Neumann was to prove that though there are no
set of precise plays you can make in a game like poker to ensure one
always wins or at least draws, there are strategies that can be derived
through mathematics to determine the best outcome.

The mathematics behind these strategies is extremely difficult and
some of the most brilliant mathematicians are still employed by
stock brokers and investment companies to apply Game Theory
to the markets and business.

Von Neumann himself was employed by the RAND Corporation
during the Cold War to model the interaction between the US and USSR
both politically and in the event of war.

If you have ever seen the movie, "A Beautiful Mind", Nash extended
Game Theory to what are called "non-cooperative games".

So these major wins by computers at poker - a true game in a Game
Theory sense - represents a new milestone for computation.

The second significant aspect of the win reported in the article was that
the processor used was not a supercomputer by today's standards,
but a far more modest system.

Last edited by gary; 08-03-2017 at 12:28 AM.
Reply With Quote
Reply

Bookmarks


Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off

Forum Jump


All times are GMT +10. The time is now 08:11 PM.

Powered by vBulletin Version 3.8.7 | Copyright ©2000 - 2025, Jelsoft Enterprises Ltd.
Advertisement
Bintel
Advertisement