Re: [Computer-go] Understanding and implementing RAVE

2015-10-27 Thread Urban Hafner
On Tue, Oct 27, 2015 at 6:57 AM, David Fotland wrote: > Many Faces uses 2200 for RAVE_EQUIV. I found that anything between 2000 > and 3000 was about the same, and CLOP recommended 2200. 1000 was a little > worse, and 500 was much worse. In discussions with other

Re: [Computer-go] Understanding and implementing RAVE

2015-10-27 Thread Urban Hafner
On Mon, Oct 26, 2015 at 5:51 PM, Gonçalo Mendes Ferreira wrote: Well I took the liberty to steal and very crudely modify a MCTS diagram > from wikipedia: > > http://pwp.net.ipl.pt/alunos.isel/35393/mcts.png > > Maybe with images it is clearer. You seem to be using an acyclic graph

[Computer-go] Understanding and implementing RAVE

2015-10-26 Thread Urban Hafner
With the help of Michi (thank you Petr!) I’m currently working on adding RAVE to my UCT tree search. Before I get too deep into it I’d like to make sure I actually understand it correctly. It would be great if you could have a quick look at my pseudo code (mostly

Re: [Computer-go] Understanding and implementing RAVE

2015-10-26 Thread David Fotland
26, 2015 10:56 AM > To: computer-go@computer-go.org > Subject: Re: [Computer-go] Understanding and implementing RAVE > > On Mon, Oct 26, 2015 at 04:51:39PM +, Gon alo Mendes Ferreira wrote: > > >I must admit that I don t quite follow how you ve implemented things, > >

Re: [Computer-go] Understanding and implementing RAVE

2015-10-26 Thread David Fotland
Emi’s CLOP. David From: Computer-go [mailto:computer-go-boun...@computer-go.org] On Behalf Of Urban Hafner Sent: Monday, October 26, 2015 8:38 AM To: computer-go@computer-go.org Subject: Re: [Computer-go] Understanding and implementing RAVE On Mon, Oct 26, 2015 at 1:12 PM, Petr Baudis

Re: [Computer-go] Understanding and implementing RAVE

2015-10-26 Thread Petr Baudis
On Mon, Oct 26, 2015 at 11:36:51AM +0100, Urban Hafner wrote: > With the help of Michi (thank you Petr!) > I’m currently working on adding RAVE to my UCT tree search. Before I get > too deep into it I’d like to make sure I actually understand it correctly. > It

Re: [Computer-go] Understanding and implementing RAVE

2015-10-26 Thread Gonçalo Mendes Ferreira
I think we mean the same. So when black plays at a1 first we count it for black everywhere but never for white. Correct? The question is, if both black and white play a1 - because there were captures in the middle - whether both of them will update a1 in some of their nodes. I believe so. Ah

Re: [Computer-go] Understanding and implementing RAVE

2015-10-26 Thread Urban Hafner
On Mon, Oct 26, 2015 at 1:20 PM, Gonçalo Mendes Ferreira wrote: > I'm not sure about "if color of that particular (child) node was the first > to play on that intersection in the playout". What I think the authors > meant was to only increment the AMAF statistic once because of ko

Re: [Computer-go] Understanding and implementing RAVE

2015-10-26 Thread Urban Hafner
On Mon, Oct 26, 2015 at 1:12 PM, Petr Baudis wrote: This RAVE formula has been derived by David Silver as follows > (miraculously hosted by Hiroshi-san): > > http://www.yss-aya.com/rave.pdf > > Also note that RAVE_EQUIV (q_{ur} * (1-q_{ur}) / b_r^2) varies widely > among

Re: [Computer-go] Understanding and implementing RAVE

2015-10-26 Thread Petr Baudis
On Mon, Oct 26, 2015 at 04:51:39PM +, Gonçalo Mendes Ferreira wrote: > >I must admit that I don’t quite follow how you’ve implemented things, but > >then you seem to be further along than me as I haven’t even started with > >transposition tables. > > > >Urban > > > Well I took the liberty to

Re: [Computer-go] Understanding and implementing RAVE

2015-10-26 Thread Urban Hafner
On Mon, Oct 26, 2015 at 5:03 PM, Gonçalo Mendes Ferreira wrote: > I think we mean the same. So when black plays at a1 first we count it for >> black everywhere but never for white. Correct? >> > The question is, if both black and white play a1 - because there were > captures in

Re: [Computer-go] Understanding and implementing RAVE

2015-10-26 Thread Gonçalo Mendes Ferreira
I must admit that I don’t quite follow how you’ve implemented things, but then you seem to be further along than me as I haven’t even started with transposition tables. Urban Well I took the liberty to steal and very crudely modify a MCTS diagram from wikipedia:

Re: [Computer-go] Understanding and implementing RAVE

2015-10-26 Thread Petr Baudis
On Mon, Oct 26, 2015 at 05:29:57PM +0100, Urban Hafner wrote: > On Mon, Oct 26, 2015 at 5:03 PM, Gonçalo Mendes Ferreira > wrote: > > > I think we mean the same. So when black plays at a1 first we count it for > >> black everywhere but never for white. Correct? > >> > > The