Re: [computer-go] Data structures for Go

[Dave Dyer <ddyer@xxxxxxxxxxx>]

To run "benson" incrementally, you have to treat groups that are 
"not black" and "not white" as first class objects, because Benson
needs to know that for each "not black" group adjacent to a black
group, all the empty spaces are liberties of the black group.

A move by black may join two or more black groups, but it may also
split the "not black" group where the move was made into two or
more new groups.

The bookeeping to do all of this, and to be able to undo it, is
quite complex, and requires storage to be allocated.  Consequently,
it is not obvious that trying to maintain all the necessary
state incrementally is worth the trouble. 

My problem solver worked this way, but it was quite slow, and the
main culprit in the slowness was the high overhead of maintaining
all these structures incrementally.



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