[computer-go] Explanation to MoGo paper wanted.

[Yamato]

>> The most important thing in the paper is how to combine RAVE(AMAF)
>> information with normal UCT. Like this:
>>
>>  uct_value = child->GetUctValue();
>>  rave_value = child->GetRaveValue();
>>  beta = sqrt(K / (3 * node->visits + K));
>>  uct_rave = beta * rave_value + (1 - beta) * uct_value;
>>
>Thanks for the translation. The only point I am still missing: What is 
>RAVE(AMAF)?

RAVE is another name of AMAF(all moves as first) heuristic.
The details of AMAF are explained in this paper.
http://www.ai.univ-paris8.fr/~bh/articles/acg10-mcgo.pdf

--
Yamato