Hi Christoph,
Thanks for replying.
Christoph Birk wrote:
On Feb 15, 2008, at 3:29 AM, Tim Foden wrote:
In your pure MC program, do you use UCB1 to choose the next move to
search at the root? If not, what algorithm are you using? I'm
currently using UCB1 for my test in Fluke.
No, it uses a
On Tue, 19 Feb 2008, Tim Foden wrote:
myCtest-AMAF is the final version ... I think it uses the 0.75 exponent.
Thanks. It seems to me that it may be worth trying 0.7 and 0.8 to see if
0.75 is a maximum or not.
As far as I remember I did that test ... and 0.75 turned out to be
be best.
On Feb 15, 2008, at 3:29 AM, Tim Foden wrote:
In your pure MC program, do you use UCB1 to choose the next move
to search at the root? If not, what algorithm are you using? I'm
currently using UCB1 for my test in Fluke.
No, it uses a random move even at the root node.
myCtest does NOT
Hi Christoph,
I'm currently trying to pretty much replicate this test with my own bot Fluke.
It's more of a confidence test than anything else. I'd like to be sure that
I've got AMAF implemented correctly (if there is any such thing :) ).
myCtest-10k
seems to gain about 420 elo from adding
