[EM] Superchargers and Afterburners

[Markus Schulze]

Dear Forest,

you wrote (16 April 2003):
> Then for n from 1 to N
>    If C_(n-1) is a beats-all candidate then let C_n = C_(n-1)
>       Else let C_n be the candidate with the greatest victory over C_(n-1)
>    End If
> Next n.
> 
> If the sequence of candidates generated by this method cycles, then break
> the cycle at its weakest link.

When I understand this method correctly then you successively break the
strongest cycle at its weakest link. Actually, this is Tideman's Ranked
Pairs method.

Markus Schulze