[computer-go] Efficiently selecting a point to play in a random playout

[Rémi Coulom]

Peter Drake wrote:
> On Jun 6, 2007, at 2:41 PM, Rémi Coulom wrote:
> 
>> Also, if you have a clever probability distribution, the range of 
>> values for each move will be very large. For instance, here are two 
>> 3x3 shapes used by Crazy Stone (# to move):
>>
>>  O O #
>>  # . .
>>  # O #
>> Gamma = 143473;
>>
>>  . # #
>>  . . .
>>  . . .
>> Gamma = 20;
>>
>> Playing in the empty corner has gamma = 1. So that would be a lot of 
>> tickets to distribute.
> 
> Is this distribution something like the number of times a given move was 
> played in your training set?

No. It is explained in my Amsterdam paper:
http://remi.coulom.free.fr/Amsterdam2007/

> 
> Doesn't the "play in empty space" pattern swamp everything else?

No. Gamma = 214 for that one.

Rémi