Google's AlphaGo Artificial Itelligence Beats Go Champion 5-0 In Big Step Forward For AI
The Ancient Chinese Board Game Is More Complex Than Chess
Games have been one of the key testing grounds for the development of Artificial Intelligence. The complex but controlled systems are excellent platforms with which to test the limits of an AI. To draw attention to the research the programs are often pitted against human players who are masters of certain games, with chess computer Deep Blue playing Garry Kasparov in the late 1990’s and more recent battles between top poker pros and AI’s like Polaris, Cepheus and Claudico.
The latest breakthrough in the battle of man vs. machine took place this week when Google’s AlphaGo AI beat European Go champion Fan Hui 5-0. The 2,500-year-old Chinese board game is one of the most complex in the world in terms of strategy and in regards to “state space,” or how many total positions are possible in the game. According to an article on statistics website FiveThirtyEight, Tic-tac-toe has a state space of 10^x3 and has been solved. Checkers, with a state space of 10^x20, is another of several less complex games that are solved.
Chess is much more complex at 10^x50. These confusing looking numbers undoubtedly offer little insight to the average person as to just how large of an amount of possible setups we are talking about, so to put it in perspective, the total number of atoms in the universe is estimated to be around 10^x80.
Go played on the standard 19 by 19 grid has a state space of 10^x171.
Written out that is 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000.
Demis Hassabis of Google’s DeepMind artificial intelligence team explained a bit about how the complex game was approached.
“We trained the neural networks on 30 million moves from games played by human experts, until it could predict the human move 57 percent of the time (the previous record before AlphaGo was 44 percent). But our goal is to beat the best human players, not just mimic them. To do this, AlphaGo learned to discover new strategies for itself, by playing thousands of games between its neural networks, and adjusting the connections using a trial-and-error process known as reinforcement learning. Of course, all of this requires a huge amount of computing power, so we made extensive use of Google Cloud Platform.”
Go, like chess and many variants of poker, is still far from being solved, but this was a huge step forward for artificial intelligence researchers.
Check out a video about the match released by Google below:
|1||Jason Mercier Close To Bracelet No. 3|
|2||Glaser Wins WSOP $10k Omaha 8/OB Championship|
|3||A Poker Life: Mike Shariati|
|4||Martin Kozlov Wins WSOP $10K Six-Max NLH Event|
|5||Final Table Set At CPPT bestbet Jacksonville Main Event|
|6||California Online Poker Bill Moves Out Of Committee|
|7||Michael Gathy Wins His Third WSOP Bracelet|
|8||2016 POY Update: Fedor Holz Takes The Lead|
|9||Moore Wins 2016 WSOP Super Seniors Event|
|10||Tech is Changing Business Model For B&Ms|
|1||Selbst Could Owe Mercier $1.8M In Controversial Bet|
|2||Disgraced Poker Player Returns To The WSOP|
|3||Jason Mercier Close To Bracelet No. 3|
|4||Lederer Follows Ferguson, Makes Return To WSOP|
|5||Rainer Kempe Wins 2016 Super High Roller Bowl|
|6||Dan Bilzerian: Kevin Hart Is Terrible At Poker|
|7||Jason Mercier Wins His Second Bracelet Of 2016 WSOP|
|8||2016 WSOP Colossus II Draws 21,613 Entries|
|9||Super High Roller Bowl: Matt Berkey Leads Final 16|
|10||NFL Player Busts WSOP Main Event Champion|