Thanks for the help with this. I actually managed to figure most of the
remaining details out on my own. I guess the chain management scheme in Orego
and Libego is a bit more efficient than mine due to the lack of pointer
initialization/management costs so I elected to modify my code and use the same
scheme.
I guess with the neighbour counts the extra cost of maintaining the data is
worth it since it is used in so many contexts.
There are some differences in my implementational choices so the code is
slightly different (and probably suboptimal)- but I am hoping to use the code
primarily to collect statistics so it doesnt have to be too fast at the moment.
_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
