Gian-Carlo Pascutto has graciously prepared a version of Leela for use
in the 13x13 scalability study. There is already some data available
on the web site and a graph.
http://cgos.boardspace.net/study/13/index.html
- Don
___
computer-go
Regarding use GTP for the CGOS communication protocol:
At one point I actually seriously considered using GTP as the
communication protocol for CGOS.It seemed rather cool that it might
be possible to hook up a program directly without needing a separate
client. It seems like we may have
On Tue, Feb 26, 2008 at 07:51:40PM +1300, Stuart A. Yeates wrote:
Adding authentication to GTP is a stunning bad idea. If we really need
an authenticated GTP, wrap the GTP we have in an SSH connection.
What a stunningly bad idea!
So anyone running a server would either have to take the trouble
Heikki Levanto wrote:
On Tue, Feb 26, 2008 at 07:51:40PM +1300, Stuart A. Yeates wrote:
Adding authentication to GTP is a stunning bad idea. If we really need
an authenticated GTP, wrap the GTP we have in an SSH connection.
What a stunningly bad idea!
Heikki,
What I got out
On Tue, Feb 26, 2008 at 12:57:28PM -0500, Don Dailey wrote:
What I got out of that was his main point that building authentication
into GTP is a bad idea.
Agreed!
And slapping on a security library, be it SSH, SSL, GPG, or something else,
without much though is only going to add hazzle and
On Tue, 26 Feb 2008, Christoph Birk wrote:
We should be careful about any conclusions ... your pairing algorithm
currently creates leela-vs-leela games only.
May I recommend removing most of the Leela instances ASAP and add
them one-by-one later. This way the alorithm would be forced to
mix up
Christoph Birk wrote:
On Tue, 26 Feb 2008, Don Dailey wrote:
The graph currently shows Leela as weaker than mogo at a given number of
simulations, but Leela appears to be catching up at higher levels.
Of course this may all prove to be nonsense after a few hundred more
games are complete.
examples:
playing Mogo_13_06 vs Leela_05 K10 J10 D4 D6 D10 C9 K4 K9 J9 K11 L10
H9 J8 H8 H10 J11 G7 H7 E6 F6 E7 E5 D5 C7 H6 D9 J7 F5 E9 G10 G6 J6 K6
J5 G8 G9 K7 F8 F7 E8 G5 F3 F4 D7 F9 D8 L11 E10 G3 E3 E4 C3 D3 D2 F2 E2
G2 L12 B4 B3 M12 C4 C5 B5 K12 J12 K13 J13 L13 M13 L12 A4 E1 F1 G1 H2
M2 M3 L2
Christoph Birk wrote:
On Tue, 26 Feb 2008, Christoph Birk wrote:
We should be careful about any conclusions ... your pairing algorithm
currently creates leela-vs-leela games only.
May I recommend removing most of the Leela instances ASAP and add
them one-by-one later. This way the alorithm
We should be careful about any conclusions ... your pairing algorithm
currently creates leela-vs-leela games only.
after 1500 or so games per leela, we should be able to tell.
i'm getting some leela vs. mogo games already...
s.
___
computer-go
On Tue, 2008-02-26 at 12:28 -0500, Don Dailey wrote:
Regarding use GTP for the CGOS communication protocol:
At one point I actually seriously considered using GTP as the
communication protocol for CGOS.It seemed rather cool that it might
be possible to hook up a program directly without
Jeff,
GTP is not a good game server protocol.I have not aggressively
added features that most game servers have, but if I did I would find
GTP too limiting. GTP is a protocol for talking to engines, not for
game servers.
The references you mentioned is what convinced me not to use GTP.
Hello.
I updated my master thesis (http://ark.qp.land.to/main.pdf). This is a final
version.
I added a experiment, and I increased the number of matches with GNUGo to 600.
It makes the conclusion more certain.
My English does not be corrected, sorry. I will practice writing English.
13 matches
Mail list logo
