[computer-go] Is Crazy Stone throwing away half its work?

[Rémi Coulom]

Peter Drake wrote:
> Okay, let me see if I have this right.
> 
> You have a node A. You do a run that goes from A through B. You do not 
> create a node for B, but you do store the result of the game in A.
> 
> Now you do a second run through A and then C. This does create a node 
> for C. However, the game result is added (?) to the result already 
> stored in A, and A's run count is incremented. Thus, to get the average 
> value of A, you take this sum and divide by 2, getting the correct value 
> even though the game that went through B is no longer in the tree.
> 
> By the time you promote A to internal (in your sense), it has many 
> children, so basing the value on the existing children and ignoring the 
> one "lost" game doesn't hurt much.
> 
> Is this correct?

Yes.

Rémi