Re: [computer-go] Depth dependent evaluation effects on monte carlo searches

2007-06-09 Thread Jason House
Magnus Persson wrote: Quoting Jason House <[EMAIL PROTECTED]>: Looking at a single color, the winning percentage seems to shift by 0.2 to 0.4%... About what I'd expect to see. What confuses me though is how to interpret the jump back and forth as the color changes (about 8%). Are the percen

Re: [computer-go] Depth dependent evaluation effects on monte carlo searches

2007-06-09 Thread Magnus Persson
Quoting Jason House <[EMAIL PROTECTED]>: Looking at a single color, the winning percentage seems to shift by 0.2 to 0.4%... About what I'd expect to see. What confuses me though is how to interpret the jump back and forth as the color changes (about 8%). Are the percentages always the winnin

Re: [computer-go] Depth dependent evaluation effects on monte carlo searches

2007-06-09 Thread Jason House
Magnus Persson wrote: Quoting Jason House <[EMAIL PROTECTED]>: Does anyone have any data on just how optimistic or pessimistic the results would be? I'd like to use some heuristics that inherit winning percentages from a parent node to bias the expected winning percentage of the children nod

Re: [computer-go] Depth dependent evaluation effects on monte carlo searches

2007-06-09 Thread RĂ©mi Coulom
Jason House wrote: Darren Cook wrote: Hi Jason, In UCT the monte carlo searches (I find it clearer to call them "the playouts") are always run to the end of the game. So they always accurately (well, as accurate as a random playout can be!) take sente in account. Therefore my understanding is th

Re: [computer-go] Depth dependent evaluation effects on monte carlo searches

2007-06-09 Thread Magnus Persson
Quoting Jason House <[EMAIL PROTECTED]>: Does anyone have any data on just how optimistic or pessimistic the results would be? I'd like to use some heuristics that inherit winning percentages from a parent node to bias the expected winning percentage of the children nodes... and maybe pruning a

Re: [computer-go] Depth dependent evaluation effects on monte carlo searches

2007-06-09 Thread Darren Cook
> Let's take a basic example of a leaf node in an MC search tree that > hasn't been expanded, but has 4 children. Let's say that random > simulation through the children have winning percentages of {46%, 51%, > 47%, 48%}. Assuming a uniform simulation policy, the winning percentage > would be the

Re: [computer-go] Depth dependent evaluation effects on monte carlo searches

2007-06-08 Thread Jason House
Darren Cook wrote: Hi Jason, In UCT the monte carlo searches (I find it clearer to call them "the playouts") are always run to the end of the game. So they always accurately (well, as accurate as a random playout can be!) take sente in account. Therefore my understanding is that it does not matte

Re: [computer-go] Depth dependent evaluation effects on monte carlo searches

2007-06-08 Thread Darren Cook
Hi Jason, In UCT the monte carlo searches (I find it clearer to call them "the playouts") are always run to the end of the game. So they always accurately (well, as accurate as a random playout can be!) take sente in account. Therefore my understanding is that it does not matter whether they start

[computer-go] Depth dependent evaluation effects on monte carlo searches

2007-06-08 Thread Jason House
For simplicities sake, let's say I do a pure 0-ply and 1-ply monte carlo search. If the color to move is my color, I'd expect the 0-ply search to give me a more conservative winning percentage than the 1-ply search (since I'd pick the best child rather than average the children together). Similar