Re:AlphaGo beats Ke Jie again to wrap up three-part match
by wapz on Thursday May 25, 2017 @05:58AM
(#14416297)
Can't they effectively "solve" chess with the power of AlphaGo? Someone posted on the last thread that the AI plays one game of go every 2 seconds against itself to train (that's ~150 moves/second). Wouldn't chess be solved for all combinations in a matter of days?
[ Parent
| on HN ]
Re:AlphaGo beats Ke Jie again to wrap up three-part match
by BoiledCabbage on Thursday May 25, 2017 @02:05PM
(#14418965)
Short answer is no. One estimate says there are 10^120th possible chess games. I'm not doing the math now, but I believe that falls into the not-physically possible within our lifetime using known physics.
An "If you had started calculating at the beginning of the universe, you wouldn't have even tackled a sliver of the work by now" type of problems.
http://www.popsci.com/science/article/2010-12/fyi-how-many-d...
Re:AlphaGo beats Ke Jie again to wrap up three-part match
by wapz on Thursday May 25, 2017 @09:28PM
(#14421488)
What I mean by solving "every" move is that the AI would be able to determine which trees are a "losing" state and not continue, removing well over 99% (or 99.999% I don't know) of the possible games. I guess maybe solve is not the correct answer but something like 99% presumption on the best or best 3 moves.
Re:AlphaGo beats Ke Jie again to wrap up three-part match
by panic on Thursday May 25, 2017 @06:43AM
(#14416463)
AlphaGo's strength is in choosing which moves to consider. Solving a game means considering every move (up to alpha-beta pruning) -- AlphaGo's techniques don't help with this.
Re:AlphaGo beats Ke Jie again to wrap up three-part match
by Madmallard on Thursday May 25, 2017 @06:04AM
(#14416320)
There are effectively limitless possibilities in terms of playouts of chess