Re: [Computer-go] New commercial Crazy Stone
Hello Remi, Because there was so much demand for analysis features, Unbalance reconsidered their plans, and after all made an English version with analysis features. It is even better than the Japanese version now, because it also shows the histogram. You can see screenshots there: http://www.unbalance.co.jp/igo/eng/ Rémi Thanks for the information. One question. On the website it is said To play Crazy Stone 2012, your PC must be connected to the Internet. How is this sentence meant? Do I need internet connection for installing the program or do I need internet connection every time when I want to play? Regards, Ingo. -- Empfehlen Sie GMX DSL Ihren Freunden und Bekannten und wir belohnen Sie mit bis zu 50,- Euro! https://freundschaftswerbung.gmx.de ___ Computer-go mailing list Computer-go@dvandva.org http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
Re: [Computer-go] A Regression test set for exploring some limitations of current MCTS programs in Go
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@dvandva.org http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
Re: [Computer-go] A Regression test set for exploring some limitations of current MCTS programs in Go
Hi Olivier, Yes that's our plan. We will appreciate very much if you could participate in our regression test and contribute Mogo's results. It will be interesting to see Mogo's performance of these test cases on large simulations like 1M, 2M, 4M or even 32M over a mega cluster/strong machine. The version of Mogo I ran over the test was downloaded at http://www.lri.fr/~teytaud/mogor It's probably not a current version and I couldn't figure out how to get Mogo's evaluation of a position. Best regards, Aja 2012/5/17 Olivier Teytaud olivier.teyt...@lri.fr If you run tests twice, you get nearly the same results ? Aja: you'll publish results with varying numbers of simulations for MC bots ? Olivier ___ Computer-go mailing list Computer-go@dvandva.org http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
Re: [Computer-go] A Regression test set for exploring some limitations of current MCTS programs in Go
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.cou...@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@dvandva.org http://dvandva.org/cgi-bin/mailman/listinfo/computer-go ___ Computer-go mailing list Computer-go@dvandva.org http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
Re: [Computer-go] Another funny kind of seki
Thanks, it is indeed a very interesting seki. In case13 the seki at the bottom-left corner is also formed in a big eye but of a different shape. Aja You'll find in attachment an interesting case of seki that maybe you don't have in your database. The White string in A11 has 3 liberties, but W must not play in any of them, because then A8 and A10 are miai for kill. Black can play in any of them, but search will not play there, because that would make W obviously alive. That position occured in a game that Crazy Stone lost against gnugo. Rémi ___ Computer-go mailing list Computer-go@dvandva.org http://dvandva.org/cgi-bin/mailman/listinfo/computer-go ___ Computer-go mailing list Computer-go@dvandva.org http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
