> 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
I have a little 7x7 go server up and running. I'm currently getting a
few player seeded - it will take quite a while to get established
ratings for players when only AnchorMan is established.
I am also working out a few web server issues. There is no way to see
the results until this is figure
At 11:33 PM 9/30/2006, you wrote:
At 09:25 PM 9/26/2006, you wrote:
... Any updates on how the Cotsen will be dealing with computer
competitors? ...
programs may enter and play against humans. please pre register - you
will get your money back if you play all of your games.
prize is $250.
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
Will other programmers be bringing their programs?
I plan to be there with SlugGo, which involves traveling with a
cluster ... and that is quite a bother!
Last year Anders was there with SmartGo, and we played our
programs against each other the day before. Anders tells me
that this year he will
At 02:55 PM 10/16/2006, you wrote:
Will other programmers be bringing their programs?
don't know.
I plan to be there with SlugGo, which involves traveling with a
cluster ... and that is quite a bother!
yes, but if no one else enters, you have a lock :)
Last year Anders was there with Smar
