A new position is always visited unless the leaf of the tree is the end of the game. In that case, one player always win, so the other always win. Then, the losing player will explore all the other moves to avoid the sure loss. If all moves are still loosing, that will propagate to the move before, and the exploration will begin and so on. There is indeed no forced exploration, but there is exploration as soon as a move is loosing. I can totally be wrong, but currently I don't see where this does not hold. Does it?
Sylvain 2008/2/10, Olivier Teytaud <[EMAIL PROTECTED]>: > > - at "each" (or every n) iteration you add one node. > > As far as I see, new nodes are created only if new nodes are visited; > if > score(visited nodes) > score(unvisited nodes) > why would mogo visit new nodes ? > > But (before the recent PDF file) I never understood completly > the bandit in mogo, so you are probably right :-) > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ > _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
