Hi Cameron, This is not new; I've been using algorithms like this in my Go programs for well over a decade. Anyone with some practical experience in binary image processing should know basic operations for dilation, erosion, growing objects under a mask, etc.
Migos and Magog used a bitboard representation that did not track liberties. I think a speed comparison for well optimized code using pure bit-boards (no liberties) against using pseudo-liberties (e.g., as in early versions of Lukasz Lew's libEGO) would be of some interest. BTW when incrementally updating the board (per move) you can stop early when the last played stone and directly adjacent opponents (if any) are found to be alive. If there's a capture, you don't need to check suicide. Best, Erik On Sat, May 24, 2014 at 11:44 AM, Cameron Browne <[email protected]> wrote: > 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
