[computer-go] A new pairing system idea for CGOS

[David Doshay]

Ahhh ... much clearer now. I had remembered a slightly different set  
of steps.

Cheers,
David



On 5, Oct 2006, at 4:30 PM, Christoph Birk wrote:

> Here are the results. The alorithm works like this:
> 1) take highest ranking (remaining) player
> 2) choose N candidates at random (N depends on #players remaining)
> 3) select highest ranking of the canditates
> 4) if un-paired players remain then goto 1)