3 ms·
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'
by baddox 11y ago
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.
- deleted 11y ago[deleted]