>>> Sylvain wrote:
Thinking a little more about it, I think we have to add an hypothesis
which is that, for a given move, the number of AMAF updates if < alpha
(nb total UCT updates), with alpha < 1. That seems to hold for most of
the updates (with alpha close to 0.5), but there may be cases where it
does not hold.
If I understand well, you say that, in order to ensure consistency,
we need some assumptions on the AMAF updates,
i.e. the MC simulations which decide which move will have AMAF updates.
(this would be a good piece of news for the two people trying to get rid
of some bias in the MC :-) unfortunately, it is difficult to have
statistics on the
level of mogo depending on that. It it gives some result, it is probably
only for
huge computation times and very specific positions... we need 100 000 years
before ensuring that with 5% confidence intervals on complete games :-) )
(in empirical cases, I'll try to check the consistency on the example
posted by David & Michael)
_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
