2007/10/10, Don Dailey <[EMAIL PROTECTED]>:
>
> Andrés,
>
> You are right about null move of course. The assumption that other
> moves are >= to the value of a pass is much stronger in GO than in
> Chess, yet ironically it's not as effective in Go.
That was what i was trying to say. Pass is one o
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Andrés,
You are right about null move of course. The assumption that other
moves are >= to the value of a pass is much stronger in GO than in
Chess, yet ironically it's not as effective in Go.
- - Don
Andrés Domínguez wrote:
> 2007/10/9, Eric Boes
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Pass is just as good as a null move - it's the same and it isn't an
issue that hurts null move pruning.
But null move pruning isn't just about the null move. It's about the
subsequent search reduction that goes with it, otherwise it's no saving.
In
2007/10/9, Eric Boesch <[EMAIL PROTECTED]>:
> On 10/8/07, Tapani Raiko <[EMAIL PROTECTED]> wrote:
> > > May sound unpolite. But Deep Blue reached a very
> > > important step in IA. They will be known for ever.
> > > But, from a research point of view, they didn't much
> > > really. It was mainly a
In message <[EMAIL PROTECTED]>, Edward de
Grijs <[EMAIL PROTECTED]> writes
Hello all,
is something known about this tournament yet?
In
http://www.computer-go.info/events/future.html
is stated that this tournament would take place this year
in Germany, but so far no news.
Does somebody have mo
Hello all,
is something known about this tournament yet?
In
http://www.computer-go.info/events/future.html
is stated that this tournament would take place this year
in Germany, but so far no news.
Does somebody have more information?
Edward
__
Hi,
2007/10/8, Benjamin Teuber <[EMAIL PROTECTED]>:
>
> Hi everybody - especially Sylvain =)
>
> I'm wondering whether the formula to determine the balance between RAVE
> and UCT,
> beta = sqrt(c / 3 * parentVisits + c),
> has any mathematical background - or is it just a best guess for something