Re: computer-go: Programming the capturing game

[Tristan Cazenave <cazenave@xxxxxxxxxxxxxxxxx>]

And what about this one ?
:)


Bruno Bouzy wrote:
> 
> Look at the sgf file. I actually think the optimal sequence in 13 ply
> deep.
> 
> Tristan Cazenave wrote:
> 
> > Bruno Bouzy a écrit :
> > >
> > > Tristan Cazenave wrote:
> > >
> > > > You wrote your solution is depth 15, and the shortest one
> > > > I found was depth 17... I am quite interested in seeing
> > > > your solution...
> > >
> > > I carefully read your AGPS paper which is very interesting.
> > > AGPS algorithm seems to be a too selective search to me because,
> > if my
> > > reading is correct,
> > > the diagonal move on the 6x6 cross-cut position leads to a13 ply
> > > capture sequence.
> > > :-|
> >
> > The shortest win I was able to find "by hand" with the diagonal move
> >
> > is 15 plies. The sgf file is attached. But you are right, it is less
> >
(;GM[1]FF[3]
RU[Chinese]SZ[6]HA[0]KM[5.5]
PW[White]
PB[Black]
GN[White (W) vs. Black (B)]
DT[2002-02-06]
SY[Cgoban 1.9.11]TM[30:00(5x1:00)];AW[dc][cd]AB[cc][dd];B[bb];W[ec]
(;B[bd];W[ce];B[de];W[be];B[ae];W[bf];B[df];W[cb];B[bc];W[db];B[cf];
W[ed];B[af])

(;B[ce];W[bd];B[de];W[bc];B[cb];W[be];B[bf];W[ae];B[ac];W[ed];B[ab];
W[ee];B[ad];W[df];B[af])

)