[computer-go] Mogo MCTS is not UCT ?

2008-12-01 Thread Denis fidaali
I think it's now well known that Mogo doesn't use UCT. I realize that i have no idea at all what Mogo do use for it's MCTS. There are only two things i dislike about UCT : - It's slow to compute. - It's deterministic I really wonder if there was an article describing the new MCTS of mogo

Re: [computer-go] RAVE formula of David Silver (reposted)

2008-12-01 Thread Jason House
On Dec 1, 2008, at 12:23 AM, Mark Boon [EMAIL PROTECTED] wrote: On 30-nov-08, at 16:51, Jason House wrote: You've claimed to be non-statistical, so I'm hoping the following is useful... You can compute the likelihood that you made an improvement as: erf(# of standard deviations) Where #

Re: [computer-go] Mogo MCTS is not UCT ?

2008-12-01 Thread Jason House
On Dec 1, 2008, at 3:38 AM, Denis fidaali [EMAIL PROTECTED] wrote: I think it's now well known that Mogo doesn't use UCT. I realize that i have no idea at all what Mogo do use for it's MCTS. There are only two things i dislike about UCT : - It's slow to compute. - It's deterministic I

[computer-go] log base e vs. log base 10

2008-12-01 Thread Mark Boon
Just now I realized that I'm using the standard Java Math.log() function in places where it computes the log(visits). In Java, this log() function is actually the logarithm of base e, which I suppose is normally actually written as ln(). When I read articles about UCT and it says log(),

Re: [computer-go] log base e vs. log base 10

2008-12-01 Thread Erik van der Werf
When unspecified always assume the natural logarithm. For UCT this does not really matter; only a different tuning constant. log10(x) == ln(x) / ln(10) Erik On Mon, Dec 1, 2008 at 3:22 PM, Mark Boon [EMAIL PROTECTED] wrote: Just now I realized that I'm using the standard Java Math.log()

RE: [computer-go] Mogo MCTS is not UCT ?

2008-12-01 Thread Denis fidaali
Let's assume that the UCT formula is UCTValue(parent, n) = winrate + sqrt((ln(parent.visits))/(5*n.nodevisits)) (taken from sensei library) What is the Upper confidence bound term ? That would'nt be sqrt((ln(parent.visits))/(5*n.nodevisits)) ?? I doubt that exploring only the move with

[computer-go] December KGS Computer Go tournament: small boards, fast

2008-12-01 Thread Nick Wedd
The December 2008 KGS computer Go tournament will be this Sunday, December 12t7 in the Asian evening, European morning and American night, starting at 08:00 UTC (GMT) and ending soon after 12:00 UTC (GMT). The Formal division will be a 12-round Swiss with 9x9 boards and 8 minutes main time.

Re: [computer-go] Mogo MCTS is not UCT ?

2008-12-01 Thread Olivier Teytaud
I think it's now well known that Mogo doesn't use UCT. I realize that i have no idea at all what Mogo do use for it's MCTS. A complicated formula mixing (i) patterns (ii) rules (iii) rave values (iv) online statistics Also we have a little learning (i.e. late parts of simulations are evolved

Re: [computer-go] Mogo MCTS is not UCT ?

2008-12-01 Thread Mark Boon
On 1-dec-08, at 18:55, Olivier Teytaud wrote: I think it's now well known that Mogo doesn't use UCT. I realize that i have no idea at all what Mogo do use for it's MCTS. A complicated formula mixing (i) patterns (ii) rules (iii) rave values (iv) online statistics Isn't that technically

[computer-go] regression testing

2008-12-01 Thread terry mcintyre
Someone recently asked about regression testing, and methods of expressing the expected results. Unfortunately, I can't find the post in question. The GnuGo regression suite appears to encode expected results in the .sgf file; here is an example: $ cat Goemate990902-1.sgf