[computer-go] Fast inner loops in Go

[Mark Boon]

On 1-sep-06, at 18:25, Anders Kierulf wrote:

> Linked lists of neighbors of each color make the inner loops fast,  
> but I
> suspect you're paying a higher price when adding or removing  
> stones, as
> removing a point from a linked list usually involves a loop.

Removing points or stones from a list should not involve any loops,  
whether the list is an array or a linked list. It should be fixed time.

Mark

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://computer-go.org/pipermail/computer-go/attachments/20060901/48d8ddda/attachment.htm