No, but soon I will publish to the public a Java Go
engine including a nice and elegant set of go base
classes.
--- George Dahl [EMAIL PROTECTED] escribió:
Does anyone know of any open source Go AI's written
in pure python?
Thanks,
George
___
We'll be the judges of that niceelegant bit ;)
I think using the ease of python to get started with algorithms and then
later pushing the performance critical sections to C and wrapping with SWIG
is a great idea.
On 5/25/07, Eduardo Sabbatella [EMAIL PROTECTED] wrote:
No, but soon I will
I don't believe this is a truly workable model. It's often stated as a
fundamental working model (especially for language advocates of tcl,
ruby, python, etc.) but in practice I have found it difficult at best.
At least if your are looking for a high performance program. It's a
nice way to
Nick Wedd wrote:
I prefer unprune to graft.
Graft implies adding something to a tree which does not naturally
belong there.
Not naturally?
Consider a tree, to which you, the tree surgeon, have taken a pair of shears,
and lopped off a branch. What has been pruned, has been pruned.
Q. By
For what it's worth, I'm getting over 25k playouts per second in Java
on my 4-core 3GHz machine using Orego.
Single easiest improvement: use the -server command line option to
Java. This turns on the just-in-time compiler, roughly doubling speed.
Peter Drake
http://www.lclark.edu/~drake/
From the www page, this python effort actually does use Lukasz' libraries for
efficiency.
From: Don Dailey [EMAIL PROTECTED]
I don't believe this is a truly workable model. It's often stated as a
fundamental working model (especially for language advocates of tcl,
ruby, python, etc.) but in
Have you noticed a difference between Java 5 and 6? I've heard some
programs get a nice boost.
- Brian
On 5/25/07, Peter Drake [EMAIL PROTECTED] wrote:
For what it's worth, I'm getting over 25k playouts per second in Java on my
4-core 3GHz machine using Orego.
Single easiest improvement: use
I was under the impression that grafting was used more often for
attaching a foreign branch (e.g., to make a pear grow on an apple
tree) than for repair. I'm probably wrong about this.
Still, in a graft, the thing being grafted on exists and is attached
to the tree. The algorithm in
Since I'm on a Mac (It'll be beautiful, but we're not giving it to
you until it's good and ready!), I'm still using Java 5.
Peter Drake
http://www.lclark.edu/~drake/
On May 25, 2007, at 10:17 AM, Brian Slesinsky wrote:
Have you noticed a difference between Java 5 and 6? I've heard some
In message [EMAIL PROTECTED], Richard Brown [EMAIL PROTECTED]
writes
Nick Wedd wrote:
I prefer unprune to graft.
Graft implies adding something to a tree which does not naturally
belong there.
Not naturally?
Consider a tree, to which you, the tree surgeon, have taken a pair of shears,
and
On 5/25/07, Peter Drake [EMAIL PROTECTED] wrote:
I was under the impression that grafting was used more often for attaching
a foreign branch (e.g., to make a pear grow on an apple tree) than for
repair. I'm probably wrong about this.
That's the same that I've heard. It may be the norm that
On 5/24/07, Chaslot G (MICC) [EMAIL PROTECTED] wrote:
Question for native English speakers: do you think this technique is best
described by progressive unpruning or progressive widening?
Widening and pruning have different implications, at least to me (a
native English speaker).
Widening is
I have been running GnuGo3.7.10 as one of the anchors on the CGOS 19x19 server,
and there don't
seem to be a lot of non-gnu players on the server over the last few days.
Since the load on my dual-core machine is negligible, I'd like to volunteer to
host an additional Go player, the better to
On 5/24/07, Darren Cook [EMAIL PROTECTED] wrote:
P.S. John, it says the new algorithm can topple strong players - shall
we just believe them and say I won that bet? We don't really need to
play the games out to prove it do we ;-).
On 9x9 they definitely can. I've lost a few games myself to the
Is there some kind of bet on this?When did that happen? What is
the bet exactly?
- Don
On Fri, 2007-05-25 at 20:47 -0400, John Tromp wrote:
On 5/24/07, Darren Cook [EMAIL PROTECTED] wrote:
P.S. John, it says the new algorithm can topple strong players - shall
we just believe them and
On 5/25/07, Don Dailey [EMAIL PROTECTED] wrote:
Is there some kind of bet on this?When did that happen? What is
the bet exactly?
Somewhere around 2000, I claimed I would not be beaten by a computer
under match conditions (eg. 10 games at 1hr per side + byo-yomi)
within 10 years. Which
I think your money is safe.
I'm not sure if the first milestone has been reached, can Mogo actually
beat you under similar conditions in a 9x9 match?I don't mean just
to win games, but can it win a long match?
Until you can be beaten pretty consistently at 9x9, I believe there is
17 matches
Mail list logo
