The referenced union-find algorithm has been known and used by computer go programs since at least the early 80's, and I'm sure it was published before 2011.
I think your implementation of union-find is a little slow. Many Faces of Go uses this algorithm, and on 9x9 got about 55k playouts per second on a much slower machine in 2008. Here is a prior discussion of bitmap performance. https://groups.google.com/forum/#!searchin/computer-go-archive/fotland$20pla youts$20per$20second/computer-go-archive/IdZtmM1Q6Ow/Q4b1IxgdkZYJ A bitmap representation can be used for fast pattern matching, so there are other advantages than just performance to using it as the base representation. > -----Original Message----- > From: [email protected] [mailto:computer-go- > [email protected]] On Behalf Of Cameron Browne > Sent: Saturday, May 24, 2014 2:45 AM > To: [email protected] > Subject: [Computer-go] Bitwise-parallel surround capture > > Hi, > > This draft paper describes a simple bitwise-parallel method for > performing surround capture: http://www.cameronius.com/research/go- > bits-1.pdf > > Before I submit it, I just wanted to check with this list that the > method is not known and already in use. > > Any general comments on the paper would also be appreciated. > > Regards, > Cameron > > _______________________________________________ > Computer-go mailing list > [email protected] > http://dvandva.org/cgi-bin/mailman/listinfo/computer-go _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
