3-Hirn-Verlag at gmx.de
Mon May 9 04:36:23 PDT 2011
Sorry, the first sentence in my previous posting
was incomplete. It should be
> A formal proof for the general case IS NOT KNOWN.
> "Only" special cases (for instance
> with one top player, (n-1) semi-strong players, n weak players) have
> been proven.
> However, one can run "some" simulations to get a feeling for it.
> The following model (with wins and losses only) will do:
> For each player i a positive number r[i] is given, his rating.
> When i plays j, i will win with prob
> r[i] / ( r[i] + r[j] ),
> and j will win with
> r[j] / ( r[i] + r[j] ).
> For simplicity we assume that different games run independently of
> each other.
> Select some set of 2*n strengths and try
> different pairing schemes to see, how often
> which player wins.
Empfehlen Sie GMX DSL Ihren Freunden und Bekannten und wir
belohnen Sie mit bis zu 50,- Euro! https://freundschaftswerbung.gmx.de
More information about the Computer-go