This may be an instance where bitmaps would be handy - altho expensive in terms
of memory - a bitmap would require NxN bits for each string of connected stones.
For each connected string, maintain a bitmap of adjacent liberties. When two
strings are connected, add the two bitmaps together - this would be a bitwise
logical OR operation.
____________________________________________________________________________________
TV dinner still cooling?
Check out "Tonight's Picks" on Yahoo! TV.
http://tv.yahoo.com/
_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
