Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
sobellian
on March 10, 2016
|
parent
|
context
|
favorite
| on:
AlphaGo Can't Beat Me, Says Chinese Go Grandmaster...
Computers cannot calculate all possible chess games. The game tree complexity of chess, 10^123, is greater than the number of atoms in the universe.
redblacktree
on March 10, 2016
[–]
The problem space shrinks as the game develops though, so there does come a point where it is possible to calculate all possible moves/outcomes.
sobellian
on March 10, 2016
|
parent
[–]
Of course, one can make the same argument about go. As I understand it computers are quite good at the endgame.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: