On Sa, 2015-09-05 at 23:51 -0700, Ray Tayek wrote:
> i am guessing that the client should make the moves if he gets them.
>
> does anyone know for sure?
From the GTP specification, page 18, 6.3.3 Core Play Commands:
"play:
[...]
Consecutive moves of the same color are not considered illegal
Hi Ray,
GTP is a strictly asymmetric protocol, not intended to
be used directly between players. The specification draft
http://www.lysator.liu.se/~gunnar/gtp/gtp2-spec-draft2/gtp2-spec.html
expresses this clearly (1.3 Communication Model):
The protocol is asymmetric and involves two parties,
On Mon, 2009-08-03 at 10:39 +0200, Folkert van Heusden wrote:
CGOS does sanity checks on the moves played by the engines that are
matched. Problem is that it might take a few hours before bugs get
triggered (due to scheduling of matches).
GoGui can let an engine play against itself and then
On Wed, 2009-07-15 at 11:24 +0200, Urban Hafner wrote:
Carter Cheng wrote:
Thanks everyone for the help thus far. I have been looking at the GTP
protocol page and I am curious which version of the protocol I should
try to implement if I want to communicate with the servers. Should I be
On Tue, 2009-07-07 at 17:09 +0100, Christian Nentwich wrote:
[..] Unless you can, in the end, show that your algorithm can
outperform another one with the same time limit, you have not proved
that it is an advance. That is why tournaments are played with time
limits, not limits on the
On Wed, 2007-11-14 at 07:25 -0800, steve uurtamo wrote:
And it's not fast either. Free() has a reputation of being
slow, and that's not surprising if you look at the way it is
almost always implemented: scanning a list of addresses in
order to amalgamate the newly freed memory with
On Wed, 2007-11-14 at 12:30 -0800, Christoph Birk wrote:
I write (astronomical) instrument control software in C that
runs for days (upto weeks). I call malloc() when I need memory
and free() when the particular sub-task is done ... no problem.
Then you are a lucky guy... ;-)
With closures
On Mon, 2007-11-12 at 20:17 -0800, steve uurtamo wrote:
C
garbage collection: free().
Well, that's not garbage collection. You will begin to notice
that if you are using shared data structures with different
lifetimes. The question that comes up again and again is can
I free this structure here
Thomas,
On Fri, 2007-08-24 at 17:26 -0500, Thomas Nelson wrote:
command = raw_input()
print = myName\n
the following is taken directly from the protocol specification:
-
2.6 Response Structure
If successful, the engine returns a
On Fri, 2007-08-24 at 19:11 -0400, George Dahl wrote:
He has two consecutive newlines since print adds one unless the print
statement has a comma at the end.
- George
Ah, thanks, didn't know that. I suspected this to be the error
because the two newlines in responses are in my experience the
On Fri, 2007-06-15 at 15:12 -0700, steve uurtamo wrote:
my last $0.02 on this -- let me know when you've written
a kernel in java, and tell me how fast your operating system
(written entirely in java) runs.
what? that can't be done? :)
Well, in fact that can be done... :-)
On Wed, 2007-03-28 at 13:44 -0700, Christoph Birk wrote:
On Wed, 28 Mar 2007, Don Dailey wrote:
One of the features I want to put into CGOS involves
a new gtp command to inform the program of the opponent,
game number, etc.I have not decided on the format
of this new gtp command and
On Wed, 2007-03-28 at 17:49 -0400, Don Dailey wrote:
That's awesome if you have a cgos client in C, I would be
happy to post the source code and/or binaries.
Yes, this is a cgos client in C, but only for the old
protocol yet. You can download the source from
Jacques,
On Tue, 2007-03-27 at 11:03 +0100, Jacques Basaldúa wrote:
Could the source code of this client be open?
I just finished the translation of the old TCL script cgosGtp.tcl
to plain C (for those of us who don't want to run a scripting language
interpreter just to connect to CGOS). You
14 matches
Mail list logo
