At the time of Your post I've had it already implemented and regarded it like "my sweet secret" :) , so I was expecting that when You published it everybody will appreciate, and start using. But I guess it wasn't easy to see benefits. I wonder how many really good ideas came through this list unnoticed.
Best Regards, Lukasz On 12/11/06, House, Jason J. <[EMAIL PROTECTED]> wrote:
Wow. Did some of my early posts on liberties/chains actually get used by someone? Or did the idea of pseudo-liberties and union sets exist before my post(s) on the topic? I remember a lot of negative feedback on pseudo-liberties at the time of my post. -----Original Message----- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Lukasz Lew Sent: Monday, December 11, 2006 1:31 PM To: [EMAIL PROTECTED] Cc: computer-go Subject: Re: [computer-go] Fast Board implementation Pseudo liberties of a group is a sum of liberties of each stone, example: OOOOO OXXXO OX.XO OXXXO OOOOO "X" group have 4 pseudo liberties. If You merge two groups just add pseudo liberties. If PL = 0 then group should be removed. This is simple and sufficient :) Lukasz On 12/11/06, Don Dailey <[EMAIL PROTECTED]> wrote: > > > On Mon, 2006-12-11 at 18:22 +0100, Łukasz Lew wrote: > > - pseudo liberties at top of union-set tree > > > Refresh my memory on this. I remember talking about this a long time > ago. A psuedo liberty is an upper bound on how many liberties there are > for a given string, correct? Sometimes a liberty gets counted twice or > more? > > But if it goes to zero or one it's correct for any given string? > > Is the idea that it's lightning fast to update incrementally? > > - Don > > > _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
