Weighted matching in chess tournaments

Snjólfur Ólafsson*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

In many chess tournaments, e.g. when the Swiss system is used, the number of players is much larger than the number of rounds to be played. In such tournaments the pairing for a round depends on the results in earlier rounds, and the pairing process can be very complicated. In these pairing systems the main goals are to let players with equal scores play together, and that each player should alternately play white and black, with the restriction that no player may face the same opponent more than once. The paper describes how a weighted matching algorithm is used to find ‘the best pairing’ by converting the pairing rules into penalty points.

Original languageEnglish
Pages (from-to)17-24
Number of pages8
JournalJournal of the Operational Research Society
Volume41
Issue number1
DOIs
Publication statusPublished - Jan 1990

Other keywords

  • Chess
  • Combinatorial optimization
  • Matching
  • Scheduling

Fingerprint

Dive into the research topics of 'Weighted matching in chess tournaments'. Together they form a unique fingerprint.

Cite this