On May 10, 2010, at 6:05 PM, Don Dailey <[email protected]> wrote:
As far as the caching issue is concerned, (to answer Peter) I assumed that all goes out the window with any of these schemes. I don't know what Peter is proposing as an alternative. Tree's with pointers are not exactly cache friendly and in Mark's scheme he has trees with pointers and an additional non-cache friendly hash table with lists of pointers. Are those lists of pointers also linked lists?
I believe many implementations store summaries of their children in the parent node in order to be friendlier to the cache.
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
