On 1/31/07, Tapani Raiko <[EMAIL PROTECTED]> wrote:
Even if each player's performance is asymmetrical but identical, the difference of performance becomes symmetrical again. But still, intransitivity can be seen from results of matches. If one has enough results of N people playing against each other, one could use the vector of performances against each opponent as an input to some machine learning method, such as a neural network or principal component analysis. I would assume that the first principal component would represent strength and the second would give some kind of intransitivity. If someone has result data with dense enough pairings, I could run some experiments.
Would the results of kgs (or similar) games being appropriate if one considered only un-handicapped games? I imagine that the most significant intransitivity would be would be in relation to the bots (principally GnuGo?), because some players have played dozens (maybe hundreds) of games against these bots and their playing style is likely to have been modified by the experience. cheers stuart
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
