Semi-skeptical discussion of the Google Go-playing paper: https://medium.com/backchannel/has-deepmind-really-passed-go-adc85e256bec#.lar62he8k … (HT @concutere & others)
Computers win at chess by brute force: searching possible moves much further ahead than humans, evaluating millions of possibilities.
-
-
It has always been known that brute-force tree search won’t work for Go; there are too many possible moves. So, you need a better evaluator.
-
The standard analysis of Go has always been that grandmasters see regional patterns on the board that are good or bad. That’s evaluation.
- 25 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.