Y
Hacker News
new
|
ask
|
show
|
jobs
by
OJFord
1061 days ago
That seems pretty different though, they have relatively few relatively straightforward fixed rules, you
can
just compute possible outcomes for moves.
1 comments
ben_w
1061 days ago
The branching factor of Go prevents brute force calculation of the best possible moves. It isn't even obvious how to write a function that evaluates how strong any given board position is. The AI had to learn functions to do that.
link