[computer-go] cgos

[Don Dailey]

On Mon, 2006-09-18 at 14:53 -0700, steve uurtamo wrote:
> > The proposed algorithm
> > would schedule in
> > "rounds" which means that all pairings are decided
> > at once, and the next
> > "round" does not commence until all the games are
> > finished.  
> 
> that makes a lot of sense to me.  it's more like
> a tournament setup, and will more fairly distribute
> games among players.
> 
> i mean, it's great if your program only takes 0.5sec
> per game, but that shouldn't mean that you are 100x
> more likely to be paired with a (potentially
> stronger) slower player...


It's not quite that bad, CGOS schedules in cycles which I think are
either 30 or 45 seconds apart.   But that was just a hack to diminish
the problem.  

I suspect that fixing the server won't slow things down as much as one
might think.   It could in some cases speed things up, because sometimes
you finish a game and have to WAIT anyway for your opponent to finish
his game.   So 2 slow players might play a 20 minute game and then one
or both of them might have to wait up to 20 more minutes for their
opponents to finish!    In practice, this rarely happens for reasons
difficult to explain in this message, but it's possible.   But it's
common to have to wait at least a few minutes.


- Don
  

> s.
> 
> __________________________________________________
> Do You Yahoo!?
> Tired of spam?  Yahoo! Mail has the best spam protection around 
> http://mail.yahoo.com