Re: [gnugo-devel] Readconnect

[Arend Bayer]

> arend 3 and 32 can be found easily by a connection reader,
Sure. Actually, in the case of arend:3, GNU Go sees that there
is no connection (there is a specific pattern telling so). What it
does, using the amalgamte_most_valuable function, is to make
two dragons looking (simplifying the situation) as follows:
OOOOO..
xx.yyyy
..x....
OOOOO..

Then the OWL-Code produces the following sequence: (O first).
OOOOO..
xx1yyyy
..x2...
OOOOO..

Then GNU Go "sees" that the (eyeless) dragon x is connected to y (which
is alive) and stops. 

Maybe the engine needs a new paradigm to handle non-transitivity of
connections? amalgamte_most_valuable is definitely not enough; OTOH,
turning it off currently leads to an overvaluation of a move by X at
1 (in different circumstances) as a triple connection.

-Arend