On Jan 26, 2009, at 6:26 PM, matt harman harman.m...@hotmail.co.uk
wrote:
That the missunderstanding right there.
1 child will be chosen and 1 simlation will be run.
Thanks for the quick answer, so 1 simulation is run because too many
will give lots of noise to the result?
Just the
Just the opposite. The noise in the win rate is 1/sqrt(n). The reason for
doing few simulations is
that they're relatively expensive. UCT and MCTS do extra tree walking because
that's less expensive
than over simulating bad moves.
- thanks jason, thats unequivocal
Beyond Hotmail - see
Hi,
After reading the pseudo code of UCT for valkyria (sept 2006)
and a paper by Sylvain gelly i was hoping someone could clear up a
few concepts. (Another newbie post im afraid) I have searched the
archives but havent found a clear answer.
Allow me to present an useless example:
With an
On Mon, 26 Jan 2009, matt harman wrote:
With an empty board, assuming I am using proximity heuristic of 1 Manhattan
distance,
from the root I will have 4 possible positions which will make up 4 children of
the root.
Each child will be simulated (eg) 1000 times and a winrate is calcuated.
If
That the missunderstanding right there.
1 child will be chosen and 1 simlation will be run.
Thanks for the quick answer, so 1 simulation is run because too many
will give lots of noise to the result? if only 1 is run then the 4 children can
either win or lose
the single simulation 0 or 1.
On Mon, 26 Jan 2009, matt harman wrote:
Thanks for the quick answer, so 1 simulation is run because too many
will give lots of noise to the result? if only 1 is run then the 4 children can
either win or lose
the single simulation 0 or 1. This would be non-deterministic so how would you
decide
