[computer-go] Effective Go Library v0.101

[Łukasz Lew]

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

On 2/13/07, Chris Fant <chrisfant at gmail.com> wrote:
> Does anyone know what "find-union algorithms" Lukasz is referring to
> in the README file?
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/
>