On 1/10/07, Łukasz Lew <[EMAIL PROTECTED]> wrote:
On 1/10/07, Don Dailey <[EMAIL PROTECTED]> wrote:
> On Wed, 2007-01-10 at 12:12 +0100, Łukasz Lew wrote:
> > > The interesting thing is that it can do a lot more play-outs when
> > > when X is high, although it is less strong. I need to understand
> > > why.
> > >
> > > Based on the paltry data I have now it's a mistake to use X that
> > > is very high.
>
> And I would point out that the evidence is paltry - need a lot more
> games to draw any conclusions. After another day of running they
> are pretty close and when you factor in the running-time difference
> the X = 100 version may be best. Of course the evidence still is
> weak and my implementation could probably be improved.
>
I do not understand Your experiment.
Setting X higher uses less memory while loosing some (not to much) information.
So one shouldn't expect strength improvement. Am I right?
BTW
I've put the epsilon trick article on my www.
(There is also a nice description of Df-Pn algorithm inside)
You ask for the URL, so:
The paper describing epsilon trick can be downloaded from:
www.mimuw.edu.pl/~lew
Łukasz
> - Don
>
>
>
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
