On Mon, 16 Oct 2006, Don Dailey wrote:
What I have decided on, based on several different simulations, is the
following:
1. Fix N at 3
2. Pick one unpaired player P at random.
3. Loop 3 times doing the following:
4. Select a potential unpaired opponent R as a candidate opponent
> When I have some free time and if Don is interested, I may run some
> simulations for the method I proposed and post some results. Don,
> please let me know whether your mind is made up already.
I am pretty sure I will stick with my original idea now of just choosing
the best of N random sele
There may be some confusion about what the assumptions and goals are for
the CGOS pairing objectives. I am hearing conflicting statements. So I
for one am unsure ;-)
Don Daily wrote (from Re: [computer-go] A new pairing system idea for
CGOS, 10/8/2006):
>> Your basic idea is sound - but it'
