> These ideas are all old,
I never said they were new. I wanted to give a mathematical argument on
them.
What would have been new would have been methods with filters applied on
the \hat{p}_i. However, though I am pretty sure I could make them more
efficient with little data, that's certainly not
Jonas Kahn wrote:
> I mean, if Crazy Stone played against himself from the position where
> Katsunari was thought to be ahead, would he win with its original color,
> or with Katsunari's ?
That is a very big question. I hope it would win with Katsunari's stones
*if*
Katsunari was really ahead.
Jacques Basaldúa wrote:
> Jonas Kahn wrote:
>
> > I mean, if Crazy Stone played against himself from the position where
> > Katsunari was thought to be ahead, would he win with its original
> color,
> > or with Katsunari's ?
>
> That is a very big question. I hope it would win with Katsunari's
>
Michael Williams wrote:
> Has the full game collection from this study been posted anywhere? I
> couldn't find any reference to it in the email list. And I didn't see
> any reference to it on the 929 scalability results page.
Here are all the games I could collect. I'm not sure whether this
I'm playing Leela a 13x13 game at level 20 -- and I'm
curious, has anyone ever tried either Leela or Mogo at
very long thinking times, as in
one-or-two-moves-per-day?
( Level 20 isn't that long -- it appears to be a few
minutes per move -- I'll have to watch the clock )
Terry McIntyre <[EMAIL P
