out of curiosity, can you estimate the largest number of opponents that all played each other a reasonable number of times? (i.e. what's the largest subset of opponents and number of games that you can choose so that everyone started playing everyone else in the subset without anyone leaving for good)? i've got some HMM code lying around and could generate the full matrix of win probabilities from such a dataset.
this would answer the question, "just how intransitively do these players play against one another". s. On Thu, Aug 28, 2008 at 12:37 PM, Don Dailey <[EMAIL PROTECTED]> wrote: > If you ever want to try, I can give you the data for cgos in compact > form that you can experiment with (one line per game - 2 names and 1 > result + date) or you can simply extract them from the archived games. > > - Don > > > On Thu, 2008-08-28 at 17:44 +0200, Rémi Coulom wrote: >> This was my post about multi-dimensional Elo: >> http://www.mail-archive.com/[email protected]/msg06267.html >> >> I have not tried it since that time. >> >> Rémi >> _______________________________________________ >> 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/ > _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
