I would be very interested to see the RAVE code?from Valkyria. I'm sure others would be too.
- Dave Hillis -----Original Message----- From: Magnus Persson <[EMAIL PROTECTED]> To: computer-go@computer-go.org Sent: Fri, 28 Nov 2008 8:58 am Subject: Re: [computer-go] RAVE formula of David Silver (reposted) This document is confusing, but here is my interpretation of it. And it works well for Valkyria. I would really want to see a pseudocode version of it. I might post the code I use for Valkyria, but it is probably not the same thing so I would probably just increase the confusion if I did...? ? Quoting Mark Boon <[EMAIL PROTECTED]>:? ? >? > What is also not clear to me from the article is how this UCT_RAVE? > value is used after it's calculated. In plain UCT search you select the? > node with the highest win/loss+UCT value. How does the virtual win/loss? > ratio get used in combination with the UCT-RAVE value resulting from? > formula (14)? Is this explained in the original by Gelly and Silver?? ? The virtual win-visits (which I think you meant and not 'win/loss') ratios *are* what is computed in Equation 12. Equation 13 is "standard UCT". You use equation 14 instead of equation 13 to select the move to search. For moves that are searched a lot Eq14 will finally approach Eq13, since Beta should go towards 0.? ? I think the term RAVE is often used in a confusing manner. Sometimes it just means AMAF or as I prefer virtual win-visit ratios, and sometimes RAVE seems to be that the algorithm that mixes the AMAF values with normal UCT-values as described in the PDF.? ? -Magnus? _______________________________________________? computer-go mailing list? [EMAIL PROTECTED] http://www.computer-go.org/mailman/listinfo/computer-go/?
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
