David Silver wrote:
> Hi all,
>
> Our paper "Sample-Based Learning and Search with Permanent and
> Transient Memories" has been accepted for publication at ICML 2008.
> Once again, I would really appreciate any feedback or comments on the
> paper.
This is nit-picky, but CGOS is supposed to mean
I have checked if there is a difference for Valkyria in using
confidence bounds or just greedily search the move with the highest
winrate. This is Valkyria 3.2.0 using 512 simulations per move against
GnuGo 3.7.10.
UCT_K Winrate SERR
0 58.82.2 (greedy)
0.0156.82.2
0.1
What level for gnugo 3.7.10?
> -Original Message-
> From: [EMAIL PROTECTED] [mailto:computer-go-
> [EMAIL PROTECTED] On Behalf Of Magnus Persson
> Sent: Thursday, April 24, 2008 8:28 AM
> To: computer-go@computer-go.org
> Subject: [computer-go] Greedy search vs UCT
>
> I have checked if t
I run it with
gnugo3.7.10.exe --mode gtp --chinese-rules --score aftermath
--capture-all-dead --positional-superko
Which is the default level which I do not know what it is.
-Magnus
Quoting David Fotland <[EMAIL PROTECTED]>:
What level for gnugo 3.7.10?
__
On Tue, Apr 22, 2008 at 4:23 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
> Here is what I'm going to do:
>
> I will take an open source chess program, Toga, and run a multi-round
> robin between 7 versions from fixed depth 1 to fixed depth 7. Two
> versions of Toga at these 7 levels where one
I noticed there is not much 19x19 activity recently. My copies of Many
Faces died and didn't notice, probably some time ago. I restarted them
today. If they stop again, just send me e-mail and I'll start them. They
have a dedicated machine in the corner, so if windows update forces a
reboot, I
On Problem 125, sounds like B2 is also a right move.
On Wed, Apr 23, 2008 at 3:33 PM, Gunnar Farnebäck <[EMAIL PROTECTED]>
wrote:
> Yamato wrote:
> > Thanks Gian-Carlo, Gunnar.
> >
> > Current list of results.
> >
> > GNU Go 3.7.12 level 0 : 24/50
> > GNU Go 3.7.12 level 10 : 34/
Weston Markham wrote:
> On Tue, Apr 22, 2008 at 4:23 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
>
>> Here is what I'm going to do:
>>
>> I will take an open source chess program, Toga, and run a multi-round
>> robin between 7 versions from fixed depth 1 to fixed depth 7. Two
>> versions
When you guys get those problems corrected, can you send an updated version?
- Don
John Fan wrote:
> On Problem 125, sounds like B2 is also a right move.
>
> On Wed, Apr 23, 2008 at 3:33 PM, Gunnar Farnebäck <[EMAIL PROTECTED]>
> wrote:
>
>
>> Yamato wrote:
>>
>>> Thanks Gian-Carlo, Gunn
John Fan wrote:
>On Problem 125, sounds like B2 is also a right move.
B:B2, W:B1, B:C1, W:A2, B:A1, W:C2, B:A3, W:D1.
Black seems to cannot win this ko.
--
Yamato
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailm
10 matches
Mail list logo
