I have experimented a little with getting moves that are likely to be best first in the list - and in come cases giving them extra weight so that quickly get expanded early. However, I never showed a measurable improvement but I didn't stick with it long enough to develop the idea fully.
My basic experiment was to place captures first and moves that avoided or put the opponent into atari, nothing very sophisticated and no patterns or general ordering. - Don On Wed, 2007-01-31 at 10:22 +0100, Vlad Dumitrescu wrote: > Hi all, > > I wonder if anybody has some data (or a theory) about how valuable a > good preordering of the children of a node would be, when UCT. This > might take the form of having nodes start with non-null values for the > 'won_simulations' and 'played_simulations' fields. > > Or maybe this could work only if combining UCT with some kind of alpha-beta? > > best regards, > Vlad > _______________________________________________ > 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/
