Jason House wrote:
In my implementation, I found that node allocation is the most
difficult part. For a tree, I suppose it may be done easily by
pre-allocating a node pool for each thread, and managing memory
allocation locally.
I was happy to hear recently that the D standard library will move to
one heap per thread. That should eliminate that issue for me. I assume
you mean the node allocation issue was because of locking on a global
heap?
Yes.
Also, don't you have to be careful that two threads don't create the
same node at the same time ? Maybe if this happens, it will just waste a
node and a playout, so it does not matter much.
Rémi
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
