The results of yesterday's KGS bot tournament are now available at
http://www.weddslist.com/kgs/past/32/index.html.
Your comments and corrections will be appreciated as usual.
Nick
--
Nick Wedd[EMAIL PROTECTED]
___
computer-go mailing list
computer
Hi,
I started experimenting with implementing own Go robot and first I
created a generic infrastructure that various engines should be able to
plug into. Currently, a random player and a straightforward MonteCarlo
bot (plays as zzgobot on KGS now) engines are implemented; the sources
are at
Nick, could you include MechaGozilla on
http://www.weddslist.com/kgs/names.html? Thanks.
Some comments about MechaGozilla's performance...
There were two blunders. Nick mentions the first one in his analysis.
Mecha failed to play a move after the cleanup stage. The other
blunder was that it di
On Mon, Nov 12, 2007 at 04:58:49PM +0100, Petr Baudis wrote:
> I started experimenting with implementing own Go robot and first I
> created a generic infrastructure that various engines should be able to
> plug into. Currently, a random player and a straightforward MonteCarlo
> bot (plays as zzgo
5x5 was solved with a massive brute force search approach. Memory was
used for large hash tables and endgames were scored early using Bensons
algorithm, otherwise it would not have been feasible from what I
understand.
Yes it was "proof" level paper, doing something lot less mathematically
val
hi Nick,
On 11/12/07, Nick Wedd <[EMAIL PROTECTED]> wrote:
> The results of yesterday's KGS bot tournament are now available at
> http://www.weddslist.com/kgs/past/32/index.html.
>
> Your comments and corrections will be appreciated as usual.
You wrote:
"In the round 8 game between FirstGoBot and
Hi John,
I get bug reports too, about once per month. So far they have never
shown an actually superko bug.
- Don
John Tromp wrote:
> hi Nick,
>
> On 11/12/07, Nick Wedd <[EMAIL PROTECTED]> wrote:
>
>> The results of yesterday's KGS bot tournament are now available at
>> http://www.weddsli
On Mon, Nov 12, 2007 at 05:11:22PM +0100, Heikki Levanto wrote:
> On Mon, Nov 12, 2007 at 04:58:49PM +0100, Petr Baudis wrote:
> > Thus, I would like to ask, how fast can your engines play out random
> > games (and on what hardware)? My random playouts are limited only with
> > rule and do-not-fi
In message <[EMAIL PROTECTED]>,
John Tromp <[EMAIL PROTECTED]> writes
hi Nick,
On 11/12/07, Nick Wedd <[EMAIL PROTECTED]> wrote:
The results of yesterday's KGS bot tournament are now available at
http://www.weddslist.com/kgs/past/32/index.html.
Your comments and corrections will be appreciated
Hi Harri,
I don't see a way to do anything larger than 5x5 as a table - and 5x5 is
pushing it. Even if we had an arbitrary amount of memory it would take
a vast amount of time to enumerate all the positions for anything larger
than 5x5.
But I am more optimistic about some kind of practical solv
On Mon, Nov 12, 2007 at 05:31:11PM +0100, Petr Baudis wrote:
> >
> > I may be wrong, but I suspect most of bots specify the total number of
> > simulations to play, not per move candidate. Thus, your '1000' should be
> > compared against a '81000' in the beginning of the game. That sounds like an
On Mon, Nov 12, 2007 at 04:58:49PM +0100, Petr Baudis wrote:
> http://rover.dkm.cz/w/zzgo.git
I seem not to be able to find anything there. Is that link correct?
- Heikki
--
Heikki Levanto "In Murphy We Turst" heikki (at) lsd (dot) dk
_
On Mon, Nov 12, 2007 at 06:05:01PM +0100, Heikki Levanto wrote:
> On Mon, Nov 12, 2007 at 04:58:49PM +0100, Petr Baudis wrote:
> > http://rover.dkm.cz/w/zzgo.git
>
> I seem not to be able to find anything there. Is that link correct?
Sorry, it's http://repo.or.cz/w/zzgo.git
Ok, on 2x2 I get a consistent result now that I implemented PSK. It
gives the same result with SSK too. It's a 1 point win for the first
player. I'm not sure this is in agreement with other peoples
findings. But it appears to be consistent.I can work my way
through the game and it alw
On 11/12/07, Don Dailey <[EMAIL PROTECTED]> wrote:
> Ok, on 2x2 I get a consistent result now that I implemented PSK. It
> gives the same result with SSK too. It's a 1 point win for the first
> player. I'm not sure this is in agreement with other peoples
> findings. But it appears to be c
On Mon, Nov 12, 2007 at 06:10:21PM +0100, Petr Baudis wrote:
> Sorry, it's http://repo.or.cz/w/zzgo.git
I've had a quick look at it, and have already two comments:
1) You seem to use struct {x,y} for coordinates all the way. I think using a
single int is usually faster. I was involved with GNU Go
On Mon, 12 Nov 2007, Heikki Levanto wrote:
I may be wrong, but I suspect most of bots specify the total number of
simulations to play, not per move candidate. Thus, your '1000' should be
compared against a '81000' in the beginning of the game. That sounds like an
overly large number to me.
Oh!
Sorry I did not have time to look at your code, but here a few quick hints:
1) Before any optimization make sure that your code works 100%
correctly. This means testing extensively and writing tests that you
can use as you start optimizing to make sure nothing breaks in the
process. You might get
On Mon, Nov 12, 2007 at 08:45:14PM +0100, Heikki Levanto wrote:
> On Mon, Nov 12, 2007 at 06:10:21PM +0100, Petr Baudis wrote:
> > Sorry, it's http://repo.or.cz/w/zzgo.git
>
> I've had a quick look at it, and have already two comments:
>
> 1) You seem to use struct {x,y} for coordinates all the w
In message <[EMAIL PROTECTED]>,
Chris Fant <[EMAIL PROTECTED]> writes
Do you know of any reasons why it would not be granted to the program author?
1. The admin considering granting it is not fully certain that the bot
account is indeed controlled by the program author.
2. The program is ver
I would like some language recommendations. Requirements:
Runs in Linux
Has garbage collection
Fast
Well supported
Can interface with MPI (can make C calls)
Hope this doesn't start a war.
___
computer-go mailing list
computer-go@computer-
On 11/12/07, Chris Fant <[EMAIL PROTECTED]> wrote:
> I would like some language recommendations. Requirements:
> Runs in Linux
> Has garbage collection
> Fast
> Well supported
> Can interface with MPI (can make C calls)
OCaml. Check on all counts.
Lars Nilsson
_
Are you a troll?
I'd recomend staying away from proprietary languages personally... for
obvious reasons. I don't think there is any language that doesn't sacrifice
some speed for garbage collection. But, speed is a relative thing. If you
don't directly use the heap in C++ (i.e. you use the smar
Opinions may differ as to what counts as "fast", but Java may be your
best choice here.
(Hint: double your speed by using the -server command-line option.)
Peter Drake
http://www.lclark.edu/~drake/
On Nov 12, 2007, at 1:41 PM, Chris Fant wrote:
I would like some language recommendations.
From: Peter Drake <[EMAIL PROTECTED]>
> Opinions may differ as to what counts as "fast", but Java may be your best
> choice here.
> (Hint: double your speed by using the -server command-line option.)
I googled "java option server" and found this tidbit which goes into more
detail:
In the a
I'm not a troll, I promise. I'm asking because I want to start a new
project. I already have a bunch of code in C++, but I've never
considered myself an expert. I think I'll cherry-pick from that and
convert to use smart pointers. Thanks for the help.
On Nov 12, 2007 5:03 PM, terry mcintyre <
On 11/12/07, Petr Baudis <[EMAIL PROTECTED]> wrote:
> Does any frequently playing real-world bot use libEGO? It seems still
> order of magnitude faster, but it looks like that is because it
> simplifies some things too much. For example, its board::merge_chains()
> does not seem to take account for
> - Original Message
> From: Chris Fant <[EMAIL PROTECTED]>
>
> I'm not a troll, I promise. I'm asking because I want to start a new
> project. I already have a bunch of code in C++, but I've never
> considered myself an expert. I think I'll cherry-pick from that and
> convert to use s
D is a truly beautiful language that has all things you require. I
recommend it highly.
Ocaml is another viable choice if you are willing to delve into
functional programming.
- Don
Chris Fant wrote:
> I would like some language recommendations. Requirements:
>Runs in Linux
>Has gar
Yes, I have plenty of experience with C# and have a full UCT engine
built in it that works for arbitrary board topographies (standard,
cylindrical, toroidal, others could be easily added). And I agree,
writing/testing/debugging is very easy. I've never used Mono.
Perhaps I should also consider th
Topologies, not topographies.
On 11/12/07, Chris Fant <[EMAIL PROTECTED]> wrote:
> Yes, I have plenty of experience with C# and have a full UCT engine
> built in it that works for arbitrary board topographies (standard,
> cylindrical, toroidal, others could be easily added). And I agree,
> writi
- Original Message
From: Chris Fant <[EMAIL PROTECTED]>
> [...] I don't care about whether the language is open or not as I am
> probably the only person who is ever going to see this code.
That's unfortunate for us! I'd love to see a UCT implementation in C#.
Phil
How about forth? A lot of the high level languages we are talking
about essentially get converted to forth (or I should say a "forth type"
language.)
- Don
Chris Fant wrote:
> I would like some language recommendations. Requirements:
>Runs in Linux
>Has garbage collection
>Fast
Nick Apperson wrote:
> Are you a troll?
Hi Nick,
We should definitely be able to talk about programming languages for our
domain of Go. I see no problem here.
- Don
> I'd recomend staying away from proprietary languages personally... for
> obvious reasons. I don't think there is any lan
On Mon, 12 Nov 2007, Chris Fant wrote:
I would like some language recommendations. Requirements:
Runs in Linux
Has garbage collection
Fast
Well supported
Can interface with MPI (can make C calls)
Forget 'garbage collection' and use 'C'.
Christoph
___
I think he was joking since he went ahead and responded to the question.
On 11/12/07, Don Dailey <[EMAIL PROTECTED]> wrote:
>
>
> Nick Apperson wrote:
> > Are you a troll?
>
> Hi Nick,
>
> We should definitely be able to talk about programming languages for our
> domain of Go. I see no problem h
haha, I was just kidding. Sorry that humor doesn't always come through.
Anyway, what is a "forth type" language. I am really interested in learning
about this. Thanks in advance.
- Nick
On Nov 12, 2007 5:59 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
> How about forth? A lot of the high level
The following text is incorrect:
"In the round 8 game between FirstGoBot and break13, this position
appeared, White has just played the marked stone. Now Black played
(stupidly) at a, White captured two stones at b, and Black (break13)
tried to recapture the one marked stone."
There is only one m
On Mon, 2007-11-12 at 15:53 -0600, Nick Apperson wrote:
> You will probably get a few people here recommending "D", but that is
> most definately not well supported and it is slower than C or C++ in
> terms of writing a go program.
D is definitely slower in execution than C/C++, but I do find it
I would like some language recommendations. Requirements:
Runs in Linux
Has garbage collection
Fast
Well supported
Can interface with MPI (can make C calls)
Hope this doesn't start a war.
---
let's see...
C
garbage collection: free().
very fast.
s.
___
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 he
WARNING: This digresses into a rant by the end... You've been warned.
If you like to have your garbage collected for you then use one of the
management strategies present in C++. If you like delayed freeing, overload
new or use a library that does this. Really, the difference between C++ and
mo
On Oct 2nd 2007 Heikki wrote:
>> I was thinking that it could be quicker to do prototyping in something like
>> python, while having fast low-level functions in C. Since we already have
>> Lukasz Lew's ego library, I wonder if anyone has written a wrapper around it
>> to call it from python (or rub
On 11/12/07, Chris Fant <[EMAIL PROTECTED]> wrote:
> I would like some language recommendations. Requirements:
>Runs in Linux
>Has garbage collection
>Fast
>Well supported
>Can interface with MPI (can make C calls)
Practically all high level languages support these features. P
On Mon, Nov 12, 2007 at 10:20:23PM -0500, Jason House wrote:
> My use of D has not all been positive. It's rarely the fault of the
> compiler itself, but stems from the immaturity of the libraries and
> supporting tools.
I think that highlights an often-ignored problem in language discussions.
Th
On Tue, Nov 13, 2007 at 03:11:40PM +0900, Darren Cook wrote:
>
> On Oct 2nd 2007 Heikki wrote:
> >> I was thinking that it could be quicker to do prototyping in something like
> >> python, while having fast low-level functions in C. Since we already have
> >> Lukasz Lew's ego library, I wonder if a
46 matches
Mail list logo
