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

2008-03-11 Thread Magnus Persson
Quoting Don Dailey [EMAIL PROTECTED]: When the child nodes are allocated, they are done all at once with this code - where cc is the number of fully legal child nodes: In valkyria3 I have supernodes that contains an array of moveinfo for all possible moves. In the moveinfo I also store

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

2008-03-11 Thread Jonas Kahn
On Tue, Mar 11, 2008 at 09:05:01AM +0100, Magnus Persson wrote: Quoting Don Dailey [EMAIL PROTECTED]: When the child nodes are allocated, they are done all at once with this code - where cc is the number of fully legal child nodes: In valkyria3 I have supernodes that contains an array of

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

2008-03-11 Thread Magnus Persson
Quoting Jonas Kahn [EMAIL PROTECTED]: On Tue, Mar 11, 2008 at 09:05:01AM +0100, Magnus Persson wrote: Quoting Don Dailey [EMAIL PROTECTED]: When the child nodes are allocated, they are done all at once with this code - where cc is the number of fully legal child nodes: In valkyria3 I have

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

2008-03-11 Thread Don Dailey
Don Dailey wrote: Petr Baudis wrote: On Mon, Mar 10, 2008 at 06:57:07PM -0400, Don Dailey wrote: I think you may still have a bug. You should get well over 1700 with 110,000 playouts, even if they are light playouts. Hmmm... That is going to be some tough

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

2008-03-11 Thread Christoph Birk
On Tue, 11 Mar 2008, Don Dailey wrote: If it is agreed, I will start a 25k test.My prediction is that this will finish around 1600 ELO on CGOS. I have long term rating for simple random playouts: myCtest-10k and myCtest-50k. I keep them active since Sept/2006. Please don't use 25k.

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

2008-03-11 Thread Jason House
If the speed was lowered to 10k, I'd also participate. One of these days, I'll speed up my engine... Sent from my iPhone On Mar 11, 2008, at 11:18 AM, Don Dailey [EMAIL PROTECTED] wrote: Don Dailey wrote: Petr Baudis wrote: On Mon, Mar 10, 2008 at 06:57:07PM -0400, Don Dailey wrote:

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

2008-03-11 Thread Don Dailey
This isn't simple random play-outs.It's monte carlo with UCT tree search. Ok, I will use 50k to match your test.It means I probably cannot run 2 tests on that machine and is why I hoped it would be minimal resource usage, but since you have already started I will restart my test. -

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

2008-03-11 Thread Christoph Birk
On Tue, 11 Mar 2008, Don Dailey wrote: This isn't simple random play-outs.It's monte carlo with UCT tree search. Ok, I will use 50k to match your test.It means I probably cannot run 2 tests on that machine and is why I hoped it would be minimal resource usage, but since you have

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

2008-03-11 Thread Don Dailey
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 I can watch the evolution of the program and 50k is too much if my program triples in run time as I introduce very heavy play-outs.(I don't want to count

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

2008-03-11 Thread Christoph Birk
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 participate. myCtest-10k-UCT has a long-term rating of about 1250. For the 50k

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

2008-03-11 Thread Petr Baudis
On Mon, Mar 10, 2008 at 10:04:18PM -0400, Don Dailey wrote: Your method is to allocate 1 node when it's been visited once or twice - very natural I agree. My method is to allocate all the children at once, and wait until the parent has been visited some number of times (currently 100). If

Re: [computer-go] Hybrid theory

2008-03-11 Thread Alain Baeckeroot
Le vendredi 1 février 2008, David Doshay a écrit : This is the direction in which we are moving with SlugGo. We also expect it to be difficult to integrate different approaches, but this has always been our research direction: when there are multiple codes which will each give an evaluation of

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

2008-03-11 Thread Jonas Kahn
Typically, how many parameters do you have to tune ? Real or two-level ? I guess I have 10 real valued and 10 binary ones. There are probably a lot of stuff that are ahrd coded and could be parameterized. Here I am also completely ignoring playouts that have hundreds of handtuned

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

2008-03-11 Thread Petr Baudis
On Tue, Mar 11, 2008 at 11:41:41AM -0700, Christoph Birk 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 participate.

Re: [computer-go] Hybrid theory

2008-03-11 Thread David Doshay
We are still bringing up our 2nd method, so we are not yet as far as choosing a voting method. Cheers, David On 11, Mar 2008, at 12:18 PM, Alain Baeckeroot wrote: Le vendredi 1 février 2008, David Doshay a écrit : This is the direction in which we are moving with SlugGo. We also expect it