[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [computer-go] Groups, liberties, and such
Yes, I realized my mistake right away and was hoping that I
could admit my error before someone else picked me up.
But you beat me to it!
Don't you guys have anything better to do? :-) just kidding.
On Monday 17 October 2005 1:16 pm, Valery wrote:
> drd@xxxxxxxxxxxxxxxxx a écrit :
> >When a move connects 2 strings, isn't it easy and fast to calculate
> >the liberty count of the newly combined string?
> > new_count = old_string_A_count + old_string_B_count - 1 + LNC.
> >LNC means Liberties Not in Common. For the newly placed stone (that does
> >the connecting), we look at the 4 neighbor points. If they are empty,
> >we tally 1 if they are not liberties of EITHER of the OLD strings.
> >This idea is easily extended for connections of 3 or 4 groups.
> >When connecting 2 groups, you would have to look at 6 points at most,
> >the 2 possible new liberties, and the 3 possible points around these new
> >liberties to check if they touch the old group.
> That doesn't work because the 2 strings may have common liberties far
> away from the connecting stone.
> computer-go mailing list
computer-go mailing list