Author: José de Jesús García Ruvalcaba
Date: 04:26:37 06/10/04
Go up one level in this thread
On June 09, 2004 at 18:25:36, Dieter Buerssner wrote: >On June 09, 2004 at 08:23:00, José de Jesús García Ruvalcaba wrote: > >>It actually implies that for any number of players, we can find swiss pairings >>up to n-3 rounds (you may assume n is even, if n is odd it is sharper and up to >>n-2 rounds). Of course I am assuming no dropouts from the tournament and other >>irregularities. > >Do I understand you correctly, that this is independent of already played >rounds, and however they were paired. Let me give an example with 14 players >(a-n) and 8 or more rounds. Say the first seven rounds were (color and results >etc. ignored): > >1: a-h b-i c-j d-k e-l f-m g-n >2: a-i b-j c-k d-l e-m f-n g-h >3: a-j b-k c-l d-m e-n f-h g-i >4: a-k b-l c-m d-n e-h f-i g-j >5: a-l b-m c-n d-h e-i f-j g-k >6: a-m b-n c-h d-i e-j f-k g-l >7: a-n b-h c-i d-j e-k f-l g-m >8: ??? > >Now, how do you pair the 8th round? > >Regards, >Dieter Oops, actually I slightly misapplied the theorem from the book. What it implies is: IF the first n-4 rounds were paired, then round n-3 can also be paired (here I am ignoring the absolute colour rules). But the theorem does not imply that a perfect coupling can be found for all the rounds previous to n-3, as your example shows. José.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.