3 ms·
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 itsel
by wapz 9y ago
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?
- panic 9y agoAlphaGo'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.
- Madmallard 9y agoThere are effectively limitless possibilities in terms of playouts of chess
- jackmott 9y agono
- BoiledCabbage 9y agoShort 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-different-ways-can-chess-game-unfold http://www.popsci.com/science/article/2010-12/fyi-how-many-d...
- wapz 9y agoWhat 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.