Anyone knows the result, or better the game sgf?
On Sat, Sep 6, 2008 at 6:57 AM, Don Dailey <[EMAIL PROTECTED]> wrote:
> Great news! Look forward to seeing it happen. I hope Mogo has some
> great hardware.
>
> - Don
>
>
> On Fri, 2008-09-05 at 15:54 -0700, David Doshay wrote:
> > MoGo and Myu
Hi,
I read on the web, and some other places that most Go programs can only
evaluate "a dozen" of moves per second. Is this still true today on a
typical machine, say, single 2GHz CPU, 2GB memory?
And if this is still true, how can we make it faster?
To make the question more precise, I define
On Jan 14, 2008 6:15 PM, Jason House <[EMAIL PROTECTED]> wrote:
> slow. UCT (or generically Monte Carlo) can "evaluate" a position fairly
> quickly (maybe 1k-100k per second depending on how heavy the playout
> is), they don't give a reliable estimate. To improve this, they end up
>
1K ~ 100 K
e of Commons [June 15, 1874]
- Original Message
From: mingwu <[EMAIL PROTECTED]>
To: computer-go
Sent: Monday, January 14, 2008 7:41:01 PM
Subject: Re: [computer-go] On average how many board updates/sec can top Go
programs do these days?
On Jan 14, 2008 6:15 PM, Jason House <[E
>
> It does this by generating random legal moves. A string of legal moves, to
> the end, is one "playout."
>
OK, now I understand it generates a sequence of moves, all the way to the
game end; which means a playout typically contains 200 (from middle game) ~
300 (from opening) moves, and the so-c
entional programs do. The newer programs that are now the
> strongest are variations of the Monte Carlo method, which does
> statistical sampling, not the kinds of evaluation you specify.
>
> Cheers,
> David
>
>
>
> On 14, Jan 2008, at 7:41 PM, mingwu wrote:
>
> >
