2001 | OriginalPaper | Buchkapitel
The Evaluation of Tournament Results as a Maximization Problem in Probability Theory
verfasst von : E. Zermelo
Erschienen in: Annotated Readings in the History of Statistics
Verlag: Springer New York
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Chess tournaments are of late always arranged so that each player meets every other player k times, where k is fixed (usually k = 2, with alternate colors) . The ranking of the players is then determined by the number of games won, where an undecided (“drawn” ) game is counted as half a win for each of the partners. This method of calculation treats all games equally, regardless of the order of play, and consequently reduces chance effects to a minimum. Apparently the procedure has worked very well in practice if only a ranking is of interest, but it fails completely for broken-off tournaments (in which the number of games played is not the same for each participant).