On Sat, May 24, 2014 at 11:29 AM, David Fotland <[email protected]>wrote:
> No. Many Faces uses union find. I looked through some old literature, > including Anders’ thesis. Even though we all used this algorithm it seems > he didn’t mention it, probably because it seemed too obvious. > Orego currently uses a variation on union-find with eager path compression; each point is given a direct link to the root of its chain at the time of merging. Is there a significant speed advantage to the lazy approach? > I do use bitmaps for pattern matching arbitrary shaped patterns up to 8x8. > Does this mean that you maintain the bitmaps in parallel with the other structures? -- Peter Drake https://sites.google.com/a/lclark.edu/drake/
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
