[computer-go] Data structures for Go

[Peter Drake <drake@xxxxxxxxxx>]

We're contemplating doing some research on data structures for computer 
Go.  It is not obvious to us how to store chains, groups, eyes, 
connections, and so on in an incrementally-updatable way that supports 
undo (which is necessary for any kind of search).  The problem is 
further complicated by the fact that the objects being represented are 
fluid (growing, splitting, and merging) and sometimes ill-defined.

To give one specific example, I don't know of an incremental version 
Benson's unconditional life algorithm.  We have code to look at the 
entire board and tell what's unconditionally alive, but the whole thing 
currently has to be run from scratch for every new board.

Is this something the computer Go community would find useful, or is it 
considered a minor implementation detail?

Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/

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