> -----Original Message----- > From: Heikki Levanto <hei...@lsd.dk> > To: dailey....@gmail.com; computer-go <computer-go@computer-go.org> > Sent: Tue, 30 Dec 2008 5:22 pm > Subject: Re: [computer-go] 3-4-5 rule >
> On Tue, Dec 30, 2008 at 02:01:29PM -0500, Don Dailey wrote: > > It looks like 3 is no good: > > > > Rank Name Elo + - games score oppo. draws > > 1 base 2000 296 199 3 67% 1888 0% > > 2 d3p 1888 199 296 3 33% 2000 0% > > > > I think I have proven decisively that 3 doesn't work, it lost 2 out of > > the 3 games I played :-) > So sorry, but as far as I can see, three games don't prove very much. Could > you please run at least 10 games more, before jumping into conclusions. > -H Yes, 10 more trials would conclusively prove that 2.5 is the correct value. (Our sense of humor is what makes engineers the life of every party.) Actually, the best?answer might turn out to be something like?2.5 or 3.5. I have a similar rule in my program, but I search for neighbors in a square region because I am interested in Knight's moves and Monkey Jumps. ? - Dave Hillis
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
