Re: [computer-go] Chains and liberties - performance

[William Harold Newman <william.newman@xxxxxxxxxxx>]

On Mon, Nov 15, 2004 at 09:02:26AM -0200, Mark Boon wrote:
> 
> 
> > -----Original Message-----
> > From: computer-go-bounces@xxxxxxxxxxxxxxxxx
> > [mailto:computer-go-bounces@xxxxxxxxxxxxxxxxx]On Behalf Of Arend Bayer
> > Sent: Sunday, November 14, 2004 22:12
> > To: computer-go
> > Subject: [computer-go] Chains and liberties - performance
> >
> >
> >
> >
> > On Sun, 14 Nov 2004, Mark Boon wrote:
> >
> >
> > static int next_stone[BOARDMAX];
> > (The circular list to traverse a string that Gunnar talked about.)
> >
> 
> I was imagining some kind of circular linked list. But now I see you just
> use an array of integers to achieve the same thing. Much more efficient.
> Very clever. I'll see if I can use that.

Circular linked lists are about as clever as my program gets with
handling of stones and liberties (and I haven't done any Java-vs.-C++
benchmarking:-), so I don't have any of my own ideas to add to this
discussion, but maybe someone would be interested in this review of
cleverness for updating general connectivity relationships:
  http://citeseer.ist.psu.edu/eppstein99dynamic.html

-- 
William Harold Newman <william.newman@xxxxxxxxxxxxxxxxx>
"Smart people believe weird things because they are skilled at
defending beliefs they arrived at for nonsmart reasons."
  -- Michael Shermer, Sept. 2002 Scientific American
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/