[computer-go] Effective Go Library v0.101

[Jason House]

?ukasz Lew wrote:
> Generally http://en.wikipedia.org/wiki/Disjoint-set_data_structure
> In my program it's a tree for each group of stones. In the root is
> number of pseudoliberties.
> Joining is cheap and checking group membership is cheap.
>
> Look at chain_t class. in board.cpp
>
> Best,
> ?ukasz Lew

I had done similar once upon a time in my bot and later moved away from 
the disjoint set approach because of the headache that undo created. Out 
of curiosity, is this library intended to support MC clients 
specifically or other types of searches (such as alpha-beta that tends 
to back up its search frequently?