David Fotland wrote: > Yes, I walk both chains looking for duplicates. This is quite fast if done > efficiently, since group merging is rare enough. I found keeping the > liberty arrays to be slower since they are big, so there is more copy > overhead in the UCT tree, and they are not cache friendly.
Leela also just keeps a liberty count. When two strings are merged, it walks the shortest chain and looks for empty neighbours that are shared. This is very simple, and very fast. -- GCP _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
