Folkert van Heusden a écrit :
Hi,
Are there any libraries in c/c++/java for development of a go-brain?
I imagine that things like finding connected areas has been implemented
a million times?
look at my list here :
http://ricoh51.free.fr/go/engineeng.htm
(not updated since Nov 2008...)
eric
Another month, another seki:
1 2 3 4 5 6 7 8 9
A - - - X - O O X -
B - - O O O O X X -
C O O - O X X O O -
D O X O X X - X O X
E - X X X X X X X X
F X - X - - O X O O
G - X - X X O O O -
H - - - X O - - O -
J - - - X O O O - -
O to play.
Pebbles rated this position as a 93% win, with o
Brian,
reading this ascii can be difficult, so I might be missing something,
but why would white play F5 after E1 in your primary variation, instead
of playing atari at B2 to prevent the seki? Would this lose on points?
(Couldn't quite tell without knowing the prisoner count)
I don't see how
>but why would white play F5 after E1 in your primary variation, instead
>of playing atari at B2 to prevent the seki? Would this lose on points?
Yes, lose on points. After O fills C3, O has 36 points secure, so O needs
one more point to win. There are two dame: at F5 and E1. So when X takes
E1,