On Mon, Apr 16, 2007 at 09:40:46AM +0900, Darren Cook wrote:
I have one interesting test that I do, which I take
with a grain of salt, but I use as a first guess estimate. I search
from the opening position a few hundred times and average the time
required to find the move e5. ...
[EMAIL PROTECTED] wrote:
I also find this kind of information very interesting and useful. Now
I have a better feel for what kind of scaling is realistic to try for
and how to measure it.
Putting some recent data points together, it look like giving Mogo 2
orders of magnitude more computer
Hi, I distantly remember a post, where someone said something
about someone (sorry... I know this is really vaque) working
on using Monte Carlo Go/UCT to estimate results in subgames,
i.e., life death, connection, capture, etc.
Does anyone know, if there are any published results on
the
I think I remember that post - with the same level of clarity unfortunately.
I use UCT for life and death. It comes into play at the scoring phase and in
polite games where the engine needs to know when it can pass. (Knowing the
score doesn't necessarily mean one knows the status of every
-Original Message-
From: [EMAIL PROTECTED]
To: computer-go@computer-go.org
Sent: Mon, 16 Apr 2007 5:26 AM
Subject: Re: [computer-go] The dominance of search (Suzie v. GnuGo)
[EMAIL PROTECTED] wrote:
I also find this kind of information very interesting and useful. Now I
have a
[EMAIL PROTECTED] wrote:
-Original Message-
From: [EMAIL PROTECTED]
To: computer-go@computer-go.org
Sent: Mon, 16 Apr 2007 5:26 AM
Subject: Re: [computer-go] The dominance of search (Suzie v. GnuGo)
[EMAIL PROTECTED]
javascript:parent.ComposeTo(dhillismail%40netscape.net, ); wrote:
This is how I set up problems for UCT. You can also manipulate
komi by using a value that makes finding the right move critical
because in some position the right move doesn't actually win
or lose the game.
- Don
On Mon, 2007-04-16 at 11:18 -0400, Álvaro Begué wrote:
As part of our testing of
