Re: [computer-go] RAVE in MoGo paper

2007-10-09 Thread Sylvain Gelly
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
 that starts at 1 and is 1/2 after a certain number of visits?


No it is just a tuning :)


Another question is about the prior integration. Apparently the prior, RAVE
 and UCT values are three different estimators for the winning probability.
 So why not use the above formula for prior vs. RAVE balancing, too, instead
 of initializing RAVE with it?


Our prior is actually classical and equivalent to a Dirichlet prior for the
RAVE value. Of course we could put the prior in other ways, put I strongly
believe that at this point the relevance of the prior is more important that
the way you use it.

Cheers,
Sylvain
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

[computer-go] Mertin's private 9×9 19×1 9 tournament

2007-10-09 Thread Edward de Grijs

 
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
_
Probeer Live.nl 
Probeer Live.nl: zoekmachine van de makers van MSN! ___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

Re: [computer-go] Mertin's private 9×9 19×19 tournam ent

2007-10-09 Thread Nick Wedd
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 more information?


This is Stefan Mertin.  He runs tournaments by getting copies of 
go-playing programs and playing them against each other.  He has told me 
of his plans to run one this year, but he may have decided that with 
CGOS working so well, it would be superfluous.  He has posted to this 
list, so let's hope he sees this thread.


Nick
--
Nick Wedd[EMAIL PROTECTED]
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/


Re: [computer-go] Former Deep Blue Research working on Go

2007-10-09 Thread Andrés Domínguez
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 technological/technical
   achivement.
  
  Maybe they will reimplement Mogo, try a null-move tweak, use a
  supercomputer, and claim to have the strongest computer Go player ever. :-)

 Naive null move is unhelpful because throughout much of a go game,
 almost every move is better than passing,

I think this is not the point of null move. Null move is if pass is good enough
to an alpha cut, then will be a _better_ move. It is not important if
pass is the
worse move, is important that there is a better (=) move than pass (not
zugzwang). Then you  bet searching not so deep.

But null nove is not a trick in Go, because pass is always a legal move. There
isn't zugzwang in Go.

Andrés

Sorry my bad english
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

Re: [computer-go] Former Deep Blue Research working on Go

2007-10-09 Thread Andrés Domínguez
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 of the worst moves
(except final) is good for null-move on Go. Of course you have
reduced depth, probably bad with alpha-beta with a bad evaluation
function, but looks interesting with UCT reducing the number of
simulations and increasing the % value. I don't use UCT, so I
haven't tried it.

Andrés
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/