Re:Why Go Still Foils the Computers
by baddox on Friday January 01, 2016 @01:00AM
(#10821215)
You can still brute force all game states in a tree with height n, with some heuristic to estimate the strength of position at each game state. I certainly don't think humans solve Go, because I've never heard of any experts being undefeated.
[ Parent
| on HN ]
There are no comments on this comment yet.