Re: [computer-go] Computer Go tournament at EGF

[Evan Daniel <evanbd@xxxxxxxxx>]

On Sat, 12 Feb 2005 09:53:37 -0800, David G Doshay <ddoshay@xxxxxxxxxxxxxxxxx> wrote:
> 
> On 12, Feb 2005, at 9:40 AM, Don Dailey wrote:
> 
> > The point he is making is that you can't isolate the execution time of
> > the algorithm from the playing strength.  It IS in fact easy to write
> > a perfect go program given no time constraints (just search until
> > solution.)
> 
> Easy in theory. I again challenge you to do it. A 1 dan program does
> not exist. Please make one that will play a 1 dan level game in
> whatever time period you wish.
> 
> >  The issue isn't how GOOD your program is, it is how good
> > it is in a given amount of time.
> 
> Your issue, not mine, so you get to chose the time for the above
> challenge.

Be reasonable.  Full search (full breadth, full depth) WILL play a
perfect game.  It just won't make its first move before the end of the
universe, let alone in our lifetimes.

So, your challenge has an implied time limit, which I will take to be
"within the attention span of this mailing list."

Therefore, your challenge is whether a 1d program can be written that
will play within a few days (weeks?) per move, at a maximum.

The issue is how good a program you can write given a specific time /
computer resources limit.

All that said, my program is slow too, and I think that slow programs
can be interesting, so I'm in favor of there being a longer time-limit
tournament.

Evan Daniel
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/