-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1
Chris Fant wrote: > Does this mean that you need to calculate the Bradley-Terry > probability for every legal move before selecting one on that > probability? Isn't that expensive? Have you tried selecting only N > legal candidates at random and then selecting one of those based on > their Bradley-Terry probability distribution to save time? You can use this model in many ways. It is not as expensive to calculate the probabibility of every legal move as you might think because no higher math functions are involved if you put it in the right form. - - Don > > On 9/20/07, Rémi Coulom <[EMAIL PROTECTED]> wrote: >> Chris Fant wrote: >>> I was not able to tell from the CrazyStone paper how the patterns are >>> used in the playouts. Can anyone enlighten me? Does it simply select >>> the move with the highest score? >>> _______________________________________________ >>> computer-go mailing list >>> computer-go@computer-go.org >>> http://www.computer-go.org/mailman/listinfo/computer-go/ >> No. It selects moves according to the Bradley-Terry probability >> distribution. Deterministic playouts cannot work, unless you have a >> super good policy. >> >> Rémi >> _______________________________________________ >> 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/ > -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFG8mgGDsOllbwnSikRAnnIAJwNG0Lsgy8pELg1QqF746T+GNwkrACggYYy fWo3T0ye+BtxPx1EM92RMLM= =0qbZ -----END PGP SIGNATURE----- _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
