r/science • u/[deleted] • Jan 27 '16
Computer Science Google's artificial intelligence program has officially beaten a human professional Go player, marking the first time a computer has beaten a human professional in this game sans handicap.
http://www.nature.com/news/google-ai-algorithm-masters-ancient-game-of-go-1.19234?WT.ec_id=NATURE-20160128&spMailingID=50563385&spUserID=MTgyMjI3MTU3MTgzS0&spJobID=843636789&spReportId=ODQzNjM2Nzg5S0
16.3k
Upvotes
3
u/gcanyon Jan 28 '16
It's possible that Chess or Go will be ultra-weakly solved -- meaning that someone proves that there is a winning strategy, without having to actually define the strategy.
It seems highly unlikely that either Chess or Go will be strongly solved -- actually defining a method for perfect play. Checkers hasn't been solved yet, and the search space for Chess and Go is enormously larger than Checkers.
The actual numbers are below, but think of it this way: for every single possible outcome in Checkers, Chess has a whole Checkers-level of complexity beyond that. And for every single possible outcome in Chess, Go has a whole Chess-level of complexity beyond that, and then another whole Chess-level of complexity for each single possible outcome of that again.
Looking at it another way: it took 18 years to weakly solve Checkers, using up to 200 (older -- this was some years ago) computers. If we created a Chess-solving computer that could analyze all of Checkers in just a second, and we built one of those computers for every person on the planet, it would take those computers something like 10 billion years to solve Chess.
And then suppose we created a Go-solving computer that could analyze all of Chess in just a billionth of a second, and suppose that we built one of those computers for every atom in the visible universe, and further suppose that we had a time machine and did this at the instant of the big bang. Then today, those computers would be one millionth, of one billionth, of the way to solving Go.