[computer-go] Adjacent Strings/Chains

[David Fotland]

For each chain I keep a list of the chain numbers of the adjacent chains.
If I need the size of an adjacent chain I can just look it up using the
chain number.

David

> -----Original Message-----
> From: computer-go-bounces at computer-go.org 
> [mailto:computer-go-bounces at computer-go.org] On Behalf Of Phil G
> Sent: Friday, September 01, 2006 3:31 PM
> To: computer-go
> Subject: [computer-go] Adjacent Strings/Chains
> 
> 
>  
> How does everyone keep track of adjacent strings/chains? For 
> each string, I keep a count of the # stones for each adjacent 
> string (include empty strings). Strings are also removed then 
> they don't have any adjacent neighbors (i.e., it's been 
> captured, or it's was part of a merged string that isn't used 
> anymore). It's was fast and easy to implement. However, it's 
> a bit slow. I was wondering if someone has a better method.
>  
> - Phil
>  
>  
>  
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org 
> http://www.computer-go.org/mailman/listinfo/computer-go/
>