I have tried using the opponents move statistics as further data points in a simple (non-tree) based program, but was not able to make anything of it. But my intuition tells me that it should be possible.
- Don On Fri, May 29, 2009 at 7:42 AM, "Ingo Althöfer" <[email protected]>wrote: > Hello, > > maybe this is old stuff for the insiders. > > In my lecture today a clever student (Hagen Riedel) > brought up the following idea to extend AMAF. > He counts in four ways moves on a specific square: > (1) How often did player A make this move in random games > which he won? > (2) How often did player A make this move in random games > which he lost? > (3) How often did opponent B make this move in random games > which A won? > (4) How often did opponent B make this move in random > games which A lost. > > Let n(1), ... n(4) be these numbers, > and q(1), ..., q(4) the respective quota. > Would it make sense to combine them by a linear combination, like > lamda(1)*q(1) + lamda(2)*q(2), > where the lamda's are appropriate positve or negative weights. > > Any comments, experiences, ...? > > Ingo. > -- > Nur bis 31.05.: GMX FreeDSL Komplettanschluss mit DSL 6.000 Flatrate und > Telefonanschluss nur 17,95 Euro/mtl.!* http://portal.gmx.net/de/go/dsl02 > _______________________________________________ > computer-go mailing list > [email protected] > http://www.computer-go.org/mailman/listinfo/computer-go/ >
_______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
