Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists
We present a constraint programming solution to the problem of generating round-robin schedules for sailing match races. Our schedules satisfy the criteria published by the International Sailing Federation (ISAF) governing body for match race pairing lists. We show that some published ISAF schedules are in fact illegal, and present corresponding legal instances and schedules that have not previously been published. Our schedules can be downloaded as blanks, then populated with actual competitors and used in match racing competitions.
KeywordsTime Slot Constraint Model Port Side Perfect Balance Pairing List
Unable to display preview. Download preview PDF.
- 2.International Sailing Federation. ISAF International Umpires’ and Match Racing Manual (2012)Google Scholar
- 4.Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, CP 2004, Toronto, Canada, September 27-October 1, pp. 482–495 (2004)Google Scholar