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

[Peter Drake]

We were looking at Coulom's paper on Crazy Stone and something gave  
us pause.  Near the end of section 2, he explains:

"Whenever a random game goes through a node that has been already  
visited once, create a new node at the next move, if it does not  
already exist."

Suppose I create node A. The next move, B, is not used to create a  
new node. I finish the game through B and store the value of this  
final position in A. Later I come back through A and randomly make  
move C. Since I've been through A before, I create a node for C. I  
then complete that game, creating no new nodes, and back the value up  
to C.

Do I also back the move up to A? If so, isn't the game that was  
played through B forgotten (and therefore wasted)?

Was this considered an acceptable loss in order to save time/space,  
or am I misinterpreting something?

Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/




-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://computer-go.org/pipermail/computer-go/attachments/20060725/1a718dec/attachment.htm