[Computer-go] A Regression test set for exploring some limitations of current MCTS programs in Go

Aja Huang ajahuang at gmail.com
Thu May 17 12:05:46 PDT 2012


I will certainly check all the cases again. Thanks to Yamato and Erik's
contributions, both Zen and Steenvreter solve all the seki cases so
probably other cases are fine. At this moment I'm too busy to clean up
Erica's code and test it. I'll probably do it later.

Aja

2012/5/17 Rémi Coulom <Remi.Coulom at free.fr>

> Also you should check some relatively easy cases where Crazy Stone fails
> at 128k and 64k. I would not be surprised if the moves suggested by Crazy
> Stone are correct.
>
> What about the result of Erica? I believe it should be similar to Crazy
> Stone :-)
>
> Rémi
>
> On 17 mai 2012, at 20:39, Aja Huang wrote:
>
> > Hi Rémi,
> >
> > Yes, you are right. Case11 is not correct. I have fixed it. Case19 is
> Hanezeki that might never occur in real games. The purpose of this search
> is to explore some limitations of current MC Go programs so Martin asked me
> to design the most difficult seki cases on the earth. Then I just did it.
> >
> > As for komi 7.0, thanks for your suggestion. We will discuss it and
> announce our decision.
> >
> > Best regards,
> > Aja
> >
> > 2012/5/17 Rémi Coulom <Remi.Coulom at free.fr>
> > Now with the correct e-mail address.
> >
> > On 17 mai 2012, at 16:43, Rémi Coulom wrote:
> >
> > > I took a closer look at the games.
> > >
> > > 19 is hanezeki:
> > > http://senseis.xmp.net/?Hanezeki
> > > I don't worry too much about that. Did this ever occur in a real game?
> > >
> > > I would recommend using non-integer komi for your tests, because they
> test the ability of the program to deal with jigo at the same time as they
> test seki. Dealing with jigo in the search is not an easy job: it is much
> more difficult to get a consistent search, with proved convergence to
> optimal play, when the outcome of the game is not binary. Completely greedy
> search will solve any position with non-integer komi, but it is likely to
> fail with integer komi (ie, get stuck on jigo when a stronger move can win
> but has a low evaluation in the beginning of the search).
> > >
> > > Crazy Stone evaluates hanezeki correctly if komi is set to 7.5 instead
> of 7.0.
> >
> > Sorry, that should be 6.5. With 6.5, Crazy Stone still fails. So
> hanezeki is still difficult.
> >
> > Rémi
> >
> > >
> > > case11 is strange. In the variation contained in the sgf, W loses by
> two points. Aja, are you sure case11 is correct?
> > >
> > > Rémi
> > _______________________________________________
> > Computer-go mailing list
> > Computer-go at dvandva.org
> > http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
> >
> > _______________________________________________
> > Computer-go mailing list
> > Computer-go at dvandva.org
> > http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
>
> _______________________________________________
> Computer-go mailing list
> Computer-go at dvandva.org
> http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://computer-go.org/pipermail/computer-go/attachments/20120517/ded4509b/attachment.html>


More information about the Computer-go mailing list