You don't have to see to the end of the game to play well.
They have done studies in computer chess which show the
number of times a deeper search changes it's mind. It
becomes smaller and smaller with depth - presumably because
most of the moves are already optimial.
Also, it is clear (in
On 4/8/07, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
The factorial of 81 is about 10^140. The number of legal positions may be
it may be 103919148791293834318983090438798793469
regards,
-John
___
computer-go mailing list
computer-go@computer-go.or
The factorial of 81 is about 10^140. The number of legal positions may be some
roots of that. It's still a huge number. The number of simulations used in UCT
grograms is several hundred thousand, which is tiny compared to the total
possible number of plays. How can they still be so successful? I
