Re: [computer-go] Hardware-Instruction.

[Darren Cook <darren@xxxxxxxxx>]

> implementation for log(N). The problem is that two stones of a chain can
> share the same liberty. How does one avoid dubble-counting when summing up
> the liberties in parallel? 
But you also need the list of the liberties so you can so something with 
them (e.g. try playing a move at each one); just needing the liberty count 
is relatively rare in my experience.

Darren
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/