Hi!
On Sun, Oct 31, 2010 at 01:33:57PM +0000, Jacques Basaldúa wrote:
> Petr Baudis wrote:
>
> > I don't quite understand. I think most programs do not
> > disallow eye-filling in the tree stage, only in the MC
> > simulation stage. So your simulations will get misevaluated,
> > but given enough time to reach final position, tree will
> > always consider evaluating the eye-filling move too.
>
> Of course. I was thinking "upwards" from the end towards
> the root as in Álvaro's induction reasoning and thought that
> if the nodes are never evaluated correctly by the simulations,
> they will never propagate correct info. But as you state, if
> you grow the tree to the infinite, why play simulations at all?
> So infinite MCTS does not need simulations and gets the result
> correct. Now, why still call it MC if the stochastic part
> is unnecessary?
Because the goal is not just algorithm that converges, but an
algorithm that converges _and_ is still practically useful. ;-)
With MCTS, you get useful results at the beginning and still correct
results if you let it run long enough.
--
Petr "Pasky" Baudis
The true meaning of life is to plant a tree under whose shade
you will never sit.
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
