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 child A has the highest winrate it will be exploited due to UCB1.
That the missunderstanding right there.
1 child will be chosen and 1 simlation will be run.
Because you have reached the leaf you will create 4 more children for A,
and this gets repeated.
My Question is: at each level of the tree do you return back to the root and
traverse through the
arm again?
yes, after each simulation.
Christoph
_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
