the program when a command is
aborted?
Thanks,
Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mai
Ah, accounting for that seems to fix the problem. Thanks!
Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/
On Jan 13, 2007, at 6:54 AM, Eduardo Sabbatella Riccardi wrote:
It seems that you GTP implementation doesn´t implements
Enjoy!
http://www.lclark.edu/~drake/go/
Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/list
s problem, make sure your program handles undo
correctly.
Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/
On Jan 15, 2007, at 9:18 AM, Eduardo Sabbatella wrote:
I found a couple of times that "aborting genmove".
Seriousl
t that be "Black passes" instead of "White passes"? There's a
similar inversion for white's turn. This causes some very strange
reporting, where it looks like one player gets several moves in a row.
Peter Drake
Assistant Professor of Computer Science
Lewis & Cl
The author is presumably Chris Lydgate, who interviewed me on this.
(Did he interview other people on this list.)
I was hoping to be quoted in the Economist. Oh, well. :-)
Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/
On Ja
, preventing Spam assaults on forums is an administrative
nightmare, I'm told.
Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/
On Feb 4, 2007, at 5:51 PM, Dmitry Kamenetsky wrote:
But what advantages does this list have over a
k and title? This was DPSV07.)
Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/
On Feb 7, 2007, at 12:36 PM, Chris Fant wrote:
In this paper, you say that you limit the number of moves to
BoardArea*2 during the playouts. For me, th
Go or itself?
This was not tested in any formal way, but including the book does
seem to increase the chance that the program will open with E5 (which
I believe is the correct opening move on 9x9) and that it will occupy
3-3 points before doing anything else.
Peter Drake
Assistant P
to store this data?
I'm going to try Terry's idea of storing individual Nodes instead of
storing the entire Node pool. Stay tuned...
Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/
___
The UCT portion. I'm storing/loading a "pre-built" UCT tree once at
startup; the disk is not accessed during the game.
Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/
On Feb 9, 2007, at 11:08 AM, terry mcintyre wrot
predict the outcome with one MC run for each move under
consideration.
Would the MoGo authors (and anyone else) care to weigh in?
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.com
ldest rule with a new
rule suggesting this move for this configuration.
My hope is that this heuristic will suggest the move that has been
most effective on similar boards.
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
co
Hmmm -- p. 735 of Russell & Norvig's AI text contains a strong
argument that "nearest-neighbor methods cannot be trusted for high-
dimensional data".
Peter Drake
http://www.lclark.edu/~drake/
On Mar 7, 2007, at 9:38 PM, Peter Drake wrote:
First, a general hypothesis
many more. Is anyone using heuristics that
don't fit into this framework?
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
I don't have a reference, but it's probably a variant of Church
Numerals:
http://en.wikipedia.org/wiki/Church_numeral
On Apr 7, 2007, at 12:54 PM, Chrilly wrote:
Up to my knowledge the first Lisp Versions had no number system.
The number n was represented as the list of numbers from 1 to n
Is there anyone on this list who is a tenured associate or full
professor at the college/university level, especially in the United
States? If so, please contact me. I have set the Reply To: field
accordingly.
Thanks,
Peter Drake
http://www.lclark.edu/~drake
ament this year?
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
[EMAIL PROTECTED]
http://www.computer-go.org/mailman/listinfo/computer-go/
I have a cunning plan in this area. I'll give the details if it works...
Peter Drake
http://www.lclark.edu/~drake/
On Apr 16, 2007, at 5:26 AM, [EMAIL PROTECTED] wrote:
Hi, I distantly remember a post, where someone said something
about someone (sorry... I know this is really
Orego also uses option B. Because UCT eventually focuses search on
the most promising moves, it probably will spend most of its time on
a single move, effectively doing A without the need for extra
parameter settings.
Peter Drake
http://www.lclark.edu/~drake/
On May 1, 2007, at 4:51 AM
the number of runs through a node is the
sum of the number of runs through the children?
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
On May 2, 2007, at 8:07 AM, Erik van der Werf wrote:
On 5/1/07, Peter Drake <[EMAIL PROTECTED]> wrote:
Like most of the UCT programs (I believe), Orego adds one tree
node per
Monte Carlo run. At present, this node includes data from the run
that
created it. Thus, after the first r
On May 2, 2007, at 8:17 AM, Peter Drake wrote:
On May 2, 2007, at 8:07 AM, Erik van der Werf wrote:
Don't you determine the sum of visits by adding all values in the
children? I guess it looks like a nice speedup to get the sum
directly
from their parent, but does that really matt
.
Iterating through the children should not be a significant time hit,
because (a) UCT trees tend to be quite shallow, rarely more than 5
moves deep, and (b) the vast majority of nodes are leaves.
Thanks,
Peter Drake
http://www.lclark.edu/~drake/
___
I didn't notice much improvement in Orego, because the tree is pretty
shallow. Of course, now that I've made speed improvements to the
program (and bought a faster computer), and now that I understand the
sum-of-children thing, the rules may have changed...
Peter
Your other comments match my experience.
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
ck of previous Zobrist
hashes for positions in the real game,)
4) If there is a violation, go back to the copy and try the next best
move
Thanks,
Peter Drake
http://www.lclark.edu/~drake/
On May 17, 2007, at 11:00 PM, Chrilly wrote:
>
I have serious problems with KO. UCT-Suzie plays g
from nodes with very
few children (often 0 or 1).
Peter Drake
http://www.lclark.edu/~drake/
On May 18, 2007, at 9:15 AM, John Tromp wrote:
On 5/18/07, Peter Drake <[EMAIL PROTECTED]> wrote:
It took me a long time to get around my mental block and accept
the advice
of everyone here, but
True...
My experience has been that (largely) ignoring the extremely rare
case of superko is a better use of the finite resources we have.
Have others found the same thing?
Peter Drake
http://www.lclark.edu/~drake/
On May 18, 2007, at 9:19 AM, Chris Fant wrote:
After search, when
The first option is what we do, too.
Peter Drake
http://www.lclark.edu/~drake/
On May 19, 2007, at 5:30 AM, Don Dailey wrote:
On Sat, 2007-05-19 at 12:32 +0200, chrilly wrote:
In the play-outs, I'm pretty sure infinite play-outs due to not
using
superko are possible - even wit
o."
Fair enough.
I was surprised not to find a copy of the javadocs on your website.
They're in the .jar file. At a later date I'll consider putting them
directly on the website, but the way web space is allocated around
here makes this awkward.
Other than that, it
Vegas this year?
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
lid. Again, it's a question of finding the right balance...
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
"Widening" sounds more natural to me.
Peter Drake
http://www.lclark.edu/~drake/
On May 24, 2007, at 8:50 AM, Chaslot G (MICC) wrote:
Dear all,
I did experiments on 19x19 Mango with 25000 simulations per move,
against GnuGo 3.6 level 0.
Without progressive unpruning, Mang
This interesting -- it implies that the place to use the heuristics
IS in the tree rather than in the playouts.
Peter Drake
http://www.lclark.edu/~drake/
On May 24, 2007, at 8:50 AM, Chaslot G (MICC) wrote:
Dear all,
I did experiments on 19x19 Mango with 25000 simulations per move
Yes, my recent (unsuccessful) experiments have also been along these
lines. It's nice to know I wasn't barking up the wrong tree after all!
Peter Drake
http://www.lclark.edu/~drake/
On May 24, 2007, at 9:35 AM, [EMAIL PROTECTED] wrote:
For the typical person in the U.S. the
I think grafting would imply attaching an already-existing structure,
as in genetic programming. This is just about expanding the allowable
area into which the tree grows.
Maybe the bonsai folks have a term for this...
Peter Drake
http://www.lclark.edu/~drake/
On May 24, 2007, at 10:56
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.
hm in question involves (re)opening a channel
for the tree to grow into, not attaching something.
Just my increasingly digressive thoughts...
Peter Drake
http://www.lclark.edu/~drake/
On May 25, 2007, at 10:10 AM, Richard Brown wrote:
Nick Wedd wrote:
I prefer "unprune" to "gra
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 bet
rrences of
...
.?.
wBw
(3. The opposite of the previous pattern.)
2300 occurrences of
###
.?.
Bww
(7. Name?)
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
elaborate way
to get around this bias here:
https://webdisk.lclark.edu/xythoswfs/webui/_xy-2352013_1-t_Gct7yJ5s%22
but I now believe that shuffling a list of vacant points is faster.
Peter Drake
http://www.lclark.edu/~drake/
On May 27, 2007, at 10:21 AM, Jason House wrote:
As I get int
May 27, 2007 2:39:55 PM
Subject: Re: [computer-go] Efficiently selecting a point to play in
a random playout
Hi,
I've tested many approaches, and the one I implemented is clearly
the best.
The bias that Peter Drake talks about is negligible and doesn't have a
noticeable impact
eal" board, where actual games moves are played, maintain
a stack of board state copies for undoing.)
Peter Drake
http://www.lclark.edu/~drake/
On May 27, 2007, at 5:28 PM, Jason House wrote:
Don Dailey wrote:
Lukasz Lew does something far more sophisticated and very fast
using the
dress listed. Does anyone else know
anything?
Peter Drake
http://www.lclark.edu/~drake/
On Jun 3, 2007, at 5:13 PM, Darren Cook wrote:
Does anyone know of UCT being used in games other than go, or outside
games altogether, such as travelling salesman problem, or some
business-related schedu
ogram and into the threads.
This one change instantly got me 25-30% more playouts per second.
Thanks for the tip!
Peter Drake
http://www.lclark.edu/~drake/
On May 27, 2007, at 11:39 AM, Łukasz Lew wrote:
Hi,
I've tested many approaches, and the one I implemented is clearly
the best.
the same thing --
maintaining the list of vacant points incrementally. Whenever there
is a capture, I just add the captured points to the list.
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http
Oddly, there doesn't seem to be much effect on speed whether I use a
single random number generator (i.e., instance of java.util.Random)
or one for each thread.
Peter Drake
http://www.lclark.edu/~drake/
On Jun 5, 2007, at 11:59 AM, Jason House wrote:
On 6/5/07, Peter Drake &l
legality" check does eliminate playing in a probable eye.)
Peter Drake
http://www.lclark.edu/~drake/
On Jun 5, 2007, at 12:18 PM, Jason House wrote:
On 6/5/07, Don Dailey <[EMAIL PROTECTED]> wrote:
But if you are taking the vacant points out it is probably not
too biased as you say
On Jun 5, 2007, at 12:58 PM, Don Dailey wrote:
On Tue, 2007-06-05 at 12:28 -0700, Peter Drake wrote:
Don't maintain the list of legal moves -- maintain the list of vacant
points (almost all of which are legal). When it's time to pick a
move,
pick a random point in the list a
This sounds a lot like the "roulette wheel" selection scheme used in
genetic algorithms. The idea is that each candidate has a different
slice of a roulette wheel, with better candidates getting bigger slices.
Peter Drake
http://www.lclark.edu/~drake/
On Jun 6, 2007, at 2:07 A
t be 3 or so.)
2b) Only apply the heuristic on the first N moves beyond the fringe
of the tree.
It currently looks like 2b is by far the best place to apply
heuristics. Do others have conflicting results?
Peter Drake
http://www.lclark.edu/~drake/
On Jun 6, 2007, at 2:41 PM, Rémi Coulom wrot
Thanks for the tip. It does seem a bit faster (5% speedup of the
program overall), and I'm willing to accept the consensus that the
randomness is better.
Peter Drake
http://www.lclark.edu/~drake/
On Jun 6, 2007, at 2:15 PM, Graham Thomson wrote:
I would be weary of using java.util.R
= 20;
Playing in the empty corner has gamma = 1. So that would be a lot
of tickets to distribute.
Is this distribution something like the number of times a given move
was played in your training set?
Doesn't the "play in empty space" pattern swamp everything else?
P
Let me mildly retract this and say that method 2 appears to be better
than method 1.
Peter Drake
http://www.lclark.edu/~drake/
On Jun 6, 2007, at 2:51 PM, Peter Drake wrote:
I assume you mean "...than finding tricks to accelerate RANDOM
playouts".
I've been messing aroun
eagerly look forward to any comments, corrections, or expansions.
Peter Drake
http://www.lclark.edu/~drake/
Chaslot G.M.J.B., Winands M.H.M. Winands, Uiterwijk J.W.H.M., van den
Herik H.J., and Bouzy B. Progressive strategies for Monte-Carlo tree
search.
1.3.1: Add heuristic value (divided by # of
By all means, try it out and write up a paper!
Peter Drake
http://www.lclark.edu/~drake/
On Jun 7, 2007, at 11:25 AM, Jason House wrote:
On 6/7/07, Peter Drake <[EMAIL PROTECTED]> wrote:
Chaslot G.M.J.B., Winands M.H.M. Winands, Uiterwijk J.W.H.M., van den
Herik H.J., and B
Is anyone else here going to the International Conference on
Artificial Intelligence in Lost Wages, Nevada later this month?
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer
matically does it to
some degree.
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
s, or goal-oriented search.
(Maybe these are three names for the same thing.) Of course, I don't
know how to do it yet...
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/m
, inherently slower than C/C++
is outdated.
Peter Drake
http://www.lclark.edu/~drake/
On Jun 15, 2007, at 10:40 AM, Álvaro Begué wrote:
I am not a Java expert, so some of what I say here might be
wrong/outdated. I don't think JIT can make Java as fast as C/C++.
There are still things
Oh, that's because I'm a lousy programmer. :-)
Peter Drake
http://www.lclark.edu/~drake/
On Jun 15, 2007, at 4:03 PM, Darren Cook wrote:
Plenty of data can be mustered for either side of this question,
but the
assumption that Java is necessarily, inherently slower than C/C++ i
es by then, and
I don't imagine many of us will be participating in youth events.
It's still a long way off, but I hope to organize a computer Go
tournament at the 2008 Congress here in Portland, Oregon.
Peter Drake
http://www.lclark.edu/~drake/
On Jun 16, 2007, at 9:02 AM, Jason
held in Beijing in October of 2008:
http://www.worldbridge.org/competitions/Calendar/files/
WorldMindSportsGames2007.pdf
Peter Drake
http://www.lclark.edu/~drake/
On Jun 16, 2007, at 1:47 PM, Erik van der Werf wrote:
On 6/16/07, Peter Drake <[EMAIL PROTECTED]> wrote:
It's still a l
important move and thus
misjudge the value of a position.
Peter Drake
http://www.lclark.edu/~drake/
On Jul 4, 2007, at 5:52 PM, Yamato wrote:
In other words UCT works well when evaluation/playouts is/are
strong. I
believe
there are still improvements possible to the UCT algorithm as
sh
e
Remi's framework of learning from professional games could be
applied in a similar manner.
Me too -- there must be something in the air!
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http
Nici Schraudolph has some 9x9 human games; I think they include some
Dan games, but I don't know how strong.
Peter Drake
http://www.lclark.edu/~drake/
On Jul 6, 2007, at 9:37 AM, Magnus Persson wrote:
Quoting chrilly <[EMAIL PROTECTED]>:
I will play with Suzie at the
Yes, it can be done quite quickly in certain circumstances:
http://www.lclark.edu/~drake/go/icai2006-final-drake.pdf
The problem, of course, is that by the time it's down to this, it's
often too late.
Peter Drake
http://www.lclark.edu/~drake/
On Jul 6, 2007, at 3:55 PM, ste
I think Steve meant that the move /should have been used as/ a ko
threat.
Peter Drake
http://www.lclark.edu/~drake/
On Jul 6, 2007, at 5:12 PM, Don Dailey wrote:
On Fri, 2007-07-06 at 16:52 -0700, steve uurtamo wrote:
The attack is easily
refuted with a capture, and when that happens no
e.g., whatever
order you have the points indexed) and see if there are any captures.
If so, the position isn't legal.
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.
Yes there is:
http://senseis.xmp.net/?InternationalGoFederation
The "clout" part is taking time, but the IGF is clearly involved in
Go at the highest level.
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
compute
I'll be there the whole time and will be playing in the US Open. Any
day is convenient for a gathering.
Thanks for organizing,
Peter Drake
http://www.lclark.edu/~drake/
On Jul 16, 2007, at 7:30 AM, Jason House wrote:
The US Go Congress begins in less than two weeks. I hav
What a timely thread!
I've reimplemented Łukasz Lew's libego in Java for the latest edition
of Orego. It includes something of an explanation of the data
structures. I believe the code itself is relatively clear.
The goodies are here:
http://www.lclark.edu/~drake/go/
Enjoy!
P
ng. I thought this was one of the large speed gains
in libego.
I'm using the same data structure as Lew. Each stone knows its chain
ID number, which can be used to look up it pseudoliberty count. I'll
hazard a guess that this is faster than traveling up a disjoint set
tree, e
(if statements), which Lew asserts is very important for speed on
modern processors.
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
, because we're not really interested in what
happens as the board becomes arbitrarily large.
Peter Drake
http://www.lclark.edu/~drake/
On Jul 20, 2007, at 8:24 AM, Jason House wrote:
On 7/20/07, Peter Drake <[EMAIL PROTECTED]> wrote:
On Jul 20, 2007, at 8:04 AM, Jason House
It looks like you're right -- but I did say O (rather than THETA), so
I'm also technically correct. :-)
Peter Drake
http://www.lclark.edu/~drake/
On Jul 20, 2007, at 9:15 AM, Richard J. Lorentz wrote:
Peter Drake wrote:
On Jul 20, 2007, at 8:04 AM, Jason House wrote:
I thou
The latest version is also fairly well-documented; if there's
anything you'd like me to explain in more detail, just let me know
and I'll (re)add it for the next version.
Peter Drake
http://www.lclark.edu/~drake/
On Aug 6, 2007, at 10:52 AM, Oliver Lewis wrote:
Orego ve
gs
of the 3rd North American Game-On Conference.
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
Or weiqi.
Peter Drake
http://www.lclark.edu/~drake/
On Oct 12, 2007, at 7:29 AM, steve uurtamo wrote:
try baduk!
s.
- Original Message
From: Chris Fant <[EMAIL PROTECTED]>
To: computer-go
Sent: Friday, October 12, 2007 10:04:23 AM
Subject: Re: [computer-go] Former Dee
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 recom
I'm in charge of organizing a computer Go event at this year's
Congress. Right now I'm trying to get one or more local companies to
donate machines and/or prize money.
I really doubt we can subsidize travel.
Stay tuned...
Peter Drake
http://www.lclark.edu/~drake/
On De
Chez Scheme is a good choice. For a book, you want Dybvig's "The
Scheme Programming Language"; it's available in dead-tree form or
(free) on-line:
http://www.scheme.com/tspl3/
Peter Drake
http://www.lclark.edu/~drake/
On Dec 12, 2007, at 1:09 AM, Nick Apperson wr
The license for Orego is GPL: basically, you can do whatever you want
with it, but don't sell it, claim our stuff is your invention, or try
to prevent anyone else from using it.
Yes, code feedback is always appreciated.
Peter Drake
http://www.lclark.edu/~drake/
On Jan 21, 2008, at
fo on moves
played from descendants of the current position. Consequently, AMAF
uses a global table, whereas RAVE data must be stored at every node.
Peter Drake
http://www.lclark.edu/~drake/
On Dec 14, 2009, at 10:06 PM, Brian Slesinsky wrote:
I'm a bit confused by the difference be
ctory conditions so radically
as to be a different game.
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
If you're looking for a conference to which to submit a paper, and
want/need it to be in the western USA, here's an option.
Peter Drake
http://www.lclark.edu/~drake/
Begin forwarded message:
From: Eurosis
Date: February 2, 2010 2:05:30 PM PST
To: dr...@lclark.edu
Subject
anks for your patience,
> Michael
> ___
> Computer-go mailing list
> Computer-go@computer-go.org
> http://computer-go.org/mailman/listinfo/computer-go
--
Peter Drake
https://sites.google.com/a/lclark.edu/drake/
_
00 AM com.gokgs.client.gtp.GtpClient d
FINEST: Got successful response to command "boardsize 13": =
Dec 07, 2014 8:39:00 AM com.gokgs.client.gtp.GtpClient d
Does anyone know what this means? Why does the opponent leave? What is the
"unknown message type -105"?
--
Peter Drake
n the email title, at mapr...@gmail.com .
>
> Nick
> --
> Nick Wedd mapr...@gmail.com
>
> ___
> Computer-go mailing list
> Computer-go@computer-go.org
> http://computer-go.org/mailman/listinfo
Correction:
The text (ending in 956) is correct, but for some reason the hyperlink in
the text ends at 95.
On Sat, Apr 25, 2015 at 9:23 AM, Peter Drake wrote:
> Nick:
>
> I think that's the wrong link -- it's for the January tournament.
>
> On Fri, Apr 24, 2015 at
at needs to be fixed, but that's
another problem.)
2) At some point in the ladder, GNU Go quietly dies without responding to
the move request.
Has anyone else encountered this?
--
Peter Drake
https://sites.google.com/a/lclark.edu/drake/
___
Computer
f the same
thing happens.
On Thu, Jun 18, 2015 at 1:41 PM, uurtamo . wrote:
> What does it do for memory management? Is it ungracefully failing while
> evaluating the ladder itself due to ram issues?
>
> steve
> On Jun 18, 2015 12:15 PM, "Peter Drake" wrote:
>
>>
Nope, we're still getting these crashes with more memory in the system. It
still looks like it's always GNU Go that's crashing, and it always happens
some way into a ladder that Orego shouldn't really be playing out.
On Thu, Jun 18, 2015 at 3:24 PM, Peter Drake wrote:
>
backtrack that gets out of hand at some
>> point. It'd be interesting to see if giving GNUGo some time limit
>> helps.
>>
>> On Thu, Jun 18, 2015 at 03:45:18PM -0700, Peter Drake wrote:
>> > Nope, we're still getting these crashes with more memory in the syste
pa];B[qa];W[jn];B[fn];W[am]
> ;B[jo];W[in];B[hn];W[sp];B[io];W[km];B[lk];W[ni];B[lm];W[mj]
> ;B[gb];W[ga];B[nh];W[ln];B[lc];W[la];B[fa];W[ea];B[im];W[jm]
> ;B[ko];W[sn];B[sh];W[gl];B[hl];W[bm];B[ob])
> ---------
>
>
> __
or 64bit, and compiler makes crash?
>
> Regards
> Hiroshi Yamashita
>
>
> ___
> Computer-go mailing list
> Computer-go@computer-go.org
> http://computer-go.org/mailman/listinfo/computer-go
>
--
Peter Drake
https://sites.
#x27;${prefix}/var'
mandir='${datarootdir}/man'
mkdir_p='mkdir -p --'
oldincludedir='/usr/include'
pdfdir='${docdir}'
prefix='NONE'
program_transform_name='s,x,x,'
psdir='${docdir}'
sbindir='${exec_prefix}/sb
> Computer-go mailing list
> Computer-go@computer-go.org
> http://computer-go.org/mailman/listinfo/computer-go
>
--
Peter Drake
https://sites.google.com/a/lclark.edu/drake/
___
Computer-go mailing list
Computer-go@computer-go.org
http://computer-go.org/mailman/listinfo/computer-go
e 64-bit problem? (Or did I misread?)
> On Jun 19, 2015 8:04 PM, "Peter Drake" wrote:
>
>> Okay, that worked (with the correction that "ibstdc" should be "libstdc").
>>
>> The new version doesn't choke on my sgf file!
>>
>> Now for th
201 - 300 of 310 matches
Mail list logo
