On Tue, May 11, 2010 at 04:34:15AM -1000, Mark Boon wrote:
>
> On May 10, 2010, at 11:09 PM, Petr Baudis wrote:
>
> >> OK. Then I'm curious, was the solution something along the lines what
> >> Don described?
> >
> > I admit I got a bit lost in who described what. ;-)
>
> Whether you store some information about each successor in the node or if you
> compute the hash-key for each child while you get its win-rate.
Each node contains (possibly null) pointer to a list of children node
structures (currently a linked list, I'm in the process of converting
that to an array right now). We currently use no hash tables, whether
to try that was the original question starting this thread. ;-)
--
Petr "Pasky" Baudis
When I feel like exercising, I just lie down until the feeling
goes away. -- xed_over
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
