|
|
|
|
|
|
by signa11
478 days ago
|
|
|
> ... This describes Go AIs as a brute force strategy with no heuristics ... no, not really, from the paper >> Also important was the use of learning by self play to learn a value function (as it was in many other games and even in chess, although learning did not play a big role in the 1997 program that first beat a world champion). Learning by self play, and learning in general, is like search in that it enables massive computation to be brought to bear. important notion here is, imho "learning by self play". required heuristics emerge out of that. they are not programmed in. |
|
|