On Sat, 01 Sep 2007, Christian Bartolomaeus via RT wrote:
Show quoted text> > > > I'm not clear about the sequencing of the rules. C13 seems to
> > > > include a number of different steps, depending on what happens
> > > > before C13.
Show quoted text> > > For sure, I'm even less an expert. But somehow I think one should
> > > arrive at the last part of the c13 function in FIDE.pm.
Show quoted text> > > If (! $pprime > 0) the last two brackets should be joined (lines 1043
> > > to 1059). It seems to me, that the algoritm doesn't get there.
I think if $pprime == 0, then the last 2 brackets should be
joined, but if it != 0, then they don't have to be.
Show quoted text> > Before getting to the joining of the last 2 brackets, you have to
> > try and find a different pairing in Bracket 2, ie in between your
> > step 4. and step 5.
Show quoted text> > It looks like the FIDE.pm in 0.06 is now, at the moment, going
> > through C14, dropping p from 3 to 2, ie pairing only 2 tables in
> > Bracket 2, before downfloating the other 2 players to Bracket 3.
Show quoted text> If I'm not mistaken, FIDE.pm doesn't downfloat those other 2 players
> straight away (as it IMHO should do, according to C6, since it is a
> homogenous group), but tries to pair them first against each other.
> Since that doesn't help for bracket 3 FIDE.pm repairs the first
> mentioned 2 tables until the remaining two players can't be paired
> against each other. Only then they are downfloated. But that means,
> the first 2 tables of Bracket 2 are unnecessarily (and maybe wrongly)
> repaired.
Yes, I think you are correct. I've uploaded version 0.07 after
doing some work on C6, C13 and C14.
It seems to be downfloating them straight away, rather than
trying to pair them.
C11, x=p=3 already, no more x increases in Bracket 2.
C14, Bracket 2, now p=2
C4, S1 & S2: 5 6 9 & 12 11 10
C5, ordered: 5 6 9 &
10 11 12
C6, Bracket tables 1 2 3 paired. E4 10&5 E4 6&11
C6others: Floating remaining 9 12 Down. [2] 5 6 9 12 11 10 => [3] 12 9 7 8
Next, Bracket 3: 12 9 7 8
C1, B1,2 test: ok, no unpairables
C2, x=0
C3, p=2 Homogeneous.
C4, S1 & S2: 9 12 & 7 8
C5, ordered: 9 12 &
7 8
C6, B4: x=0, table 1 2 NOK
C7, 8 7
C6, Bracket tables 1 2 paired. E1 9&8 E1 7&12
C6others: no non-paired players
Pairing complete
But it only gets to this point after re-pairing all 3 tables in
Bracket 2, without downfloating any players for quite a long time
But I want to follow the same rules looking for alternative
downfloaters in C13 that are followed elsewhere.
Show quoted text> At least that's how I interprete the following sequence:
Show quoted text> ====
> C14, Bracket 2, now p=2
> C4, S1 & S2: 3 5 & 6 12 11 9
> C5, ordered: 3 5 & 6 9 11 12
> C6, B1a: table 2 NOK
> C7, 6 11 9 12
> C6, B1a: table 2 NOK
> C7, 6 12 9 11
> C6, 2 tables paired. E1 6&3 E4 12&5
> C6others: Remainder Group, Bracket 2: 9 11
> C1, B1,2 test: ok, no unpairables
> C2, x=1
> C3, p=1 Homogeneous.
> C4, S1 & S2: 9 & 11
> C5, ordered: 9 & 11
> C6, 1 tables paired. E4 9&11
> C6others: no non-paired players
> Next, Bracket 3: 7 8
> C1, B1a: NOK. 7 8
> C13, Undoing Bracket 2 matches. Re-pairing Bracket 2, p=2.
> C7, 9 6 11 12
> C6, B1a: table 1 NOK
> C7, 11 6 9 12
> C6, B1a: table 1 NOK
> C7, 12 6 9 11
> C6, 2 tables paired. E4 12&3 E1 6&5
> C6others: Remainder Group, Bracket 2: 9 11
> C1, B1,2 test: ok, no unpairables
> C2, x=1
> C3, p=1 Homogeneous.
> C4, S1 & S2: 9 & 11
> C5, ordered: 9 & 11
> C6, 1 tables paired. E4 9&11
> C6others: no non-paired players
> Next, Bracket 3: 7 8
> C1, B1a: NOK. 7 8
> C13, Undoing Bracket 2 matches. Re-pairing Bracket 2, p=2.
> C7, 12 9 6 11
> C6, B1a: table 2 NOK
> C7, 12 11 6 9
> C6, B1a: table 2 NOK
> C7, last transposition
> C9, Dropping B6 for Downfloats
> C4, S1 & S2: 12 6 & 3 5 11 9
> C5, ordered: 6 12 & 3 5 9 11
> C6, 2 tables paired. E1 6&3 E4 5&12
> C6others: Remainder Group, Bracket 2: 9 11
> C1, B1,2 test: ok, no unpairables
> C2, x=1
> C3, p=1 Homogeneous.
> C4, S1 & S2: 9 & 11
> C5, ordered: 9 & 11
> C6, 1 tables paired. E4 9&11
> C6others: no non-paired players
> Next, Bracket 3: 7 8
> C1, B1a: NOK. 7 8
> C13, Undoing Bracket 2 matches. Re-pairing Bracket 2, p=2.
> C7, 3 9 5 11
> C6, 2 tables paired. E1 6&3 E1 9&12
> C6others: Remainder Group, Bracket 2: 5 11
> C1, B1a: NOK. 5 11 Bracket 2. Floating 5 Down, 11 Down, [2] 11 =>
> [3] 11 5 7
> 8
Show quoted text> Next, Bracket 3: 11 5 7 8
> C1, B1,2 test: ok, no unpairables
> C2, x=0
> C3, p=2 Heterogeneous.
> C4, S1 & S2: 11 5 & 7 8
> C5, ordered: 5 11 & 7 8
> C6, 2 tables paired. E1 7&5 E1 11&8
> C6others: no non-paired players
> Pairing complete
> ====
Yes, I think if it is a homogeneous group it should downfloat
unpaired players rather than try to pair them.
This pairing with 0.06 is different than the pairing above with
0.07.