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

Rémi Coulom Remi.Coulom at free.fr
Thu May 17 07:53:39 PDT 2012

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.


> case11 is strange. In the variation contained in the sgf, W loses by two points. Aja, are you sure case11 is correct?
> Rémi

More information about the Computer-go mailing list