Interesting discussion. Valkyria has a tree along with a transposition
table with pointers to the nodes, so it is apparently wasting some
memory on pointers. The nodes are fat ones with an array of children
with all statistical info for each child.
I might soon rewrite the tree search of Valkyria. And my question then
is: how do you do a lock free transposition table? I have been
thinking of doing a pure tree version similar to Fuego but maybe a
transposition table is better in principle.
I understand the Fuego solutions as simply having the pointer to a new
child as the only critical memory update. The only bad thing is that
this pointer is overwritten by a second thread and then one just has
to detect and discard orphans.
Is it possible to do lock free expansion with a transposition table as well?
-Magnus
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
