[computer-go] Optimal explore rates for plain UCT

[Christoph Birk]

On Tue, 11 Mar 2008, Petr Baudis wrote:
>> BTW: I count the new-node threshold like Don from the parent
>>      node, so 50 not far from your '2'.
>
> Hmm, I really wonder where this comes from, the idea seems quite
> unnatural to me.

Well, child-nodes are created by the parent. The parent keeps
a count of how many times it (the parent) has been visited, and
holds off creating the children until a threshold is exceeded.

Like Don, I create all children of a node at once, as an
array, so no pointers to individual children is necessary,
just a pointer to the first sibling.

Seem very natural to me :-)

Christoph