Re: [computer-go] Optimal explore rates for plain UCT

2008-03-12 Thread Jason House
On Mar 11, 2008, at 2:41 PM, Christoph Birk <[EMAIL PROTECTED]> wrote: On Tue, 11 Mar 2008, Don Dailey wrote: I am going to keep the 25k playouts running and add a 10k play-out version of UCT. I want to establish a standard testing size so that Great! That way Jason can also participat

Re: [computer-go] Optimal explore rates for plain UCT

2008-03-12 Thread Tim Foden
Don Dailey wrote: I suggest exactly 25,000 play-outs that we should standardize on.50,000 will tax my spare computer which I like to use for modest CGOS tests. If it is agreed, I will start a 25k test.My prediction is that this will finish around 1600 ELO on CGOS. OK, I added F

Re: [computer-go] Optimal explore rates for plain UCT

2008-03-12 Thread Don Dailey
Tim Foden wrote: > Don Dailey wrote: >> I suggest >> exactly 25,000 play-outs that we should standardize on.50,000 will >> tax my spare computer which I like to use for modest CGOS tests. >> If it is agreed, I will start a 25k test.My prediction is that this >> will finish around 1600 E

Re: [computer-go] Optimal explore rates for plain UCT

2008-03-12 Thread Jason House
On Mar 12, 2008, at 2:17 PM, Don Dailey <[EMAIL PROTECTED]> wrote: Tim Foden wrote: Don Dailey wrote: I suggest exactly 25,000 play-outs that we should standardize on.50,000 will tax my spare computer which I like to use for modest CGOS tests. If it is agreed, I will start a 25k te

Re: [computer-go] Optimal explore rates for plain UCT

2008-03-12 Thread Don Dailey
By the way,  I never experimented with the formula I use,  I just plagiarized it from information posted here.   I'm working on my own fomula in the meantime and used to use something different I made up.    What I used before worked like this:    u = (w + n) / (g + n)    u  - is what you m

Re: [computer-go] Optimal explore rates for plain UCT

2008-03-12 Thread Christoph Birk
On Wed, 12 Mar 2008, Don Dailey wrote: 1. My UCT constant is 1.0 - my formula is averageScore + c * sqrt( (2.0 * log(n)) / (10.0 * m) ); so your contstant is 2/10 = 0.2 inside the sqrt(), which is equivalent to c=0.44 ? Christoph ___ computer-go m

[computer-go] Perl Pattern Matching Go Program

2008-03-12 Thread D Gilder
Hi, I have been working on a Go playing program in Perl, which I have attached as a module. I'll try to put in on my webspace too at http://homepage.ntlworld.com/daniel.gilder/ (when I figure out why I can't log in) It can play on KGS, using the script kgsbot.pl, where its about 25 kyu on a

[computer-go] solving the nakade problem

2008-03-12 Thread Ivan Dubois
Hello, I think there is a very easy and straigthforward solution to the "nakade/seki" problem, here it is : For moves that are self-atari on a group that contains MORE than 5 stones : Both in the tree and the playouts, strictly forbid them (exactly like you forbid filling an eye).