On Sun, 2008-02-24 at 02:09 +0900, Hideki Kato wrote:
> Don Dailey: <[EMAIL PROTECTED]>:
> >I think those instructions do not apply to the new client scripts - it
> >works differently.
>
> Oh, I see. Then could you please change the link at the middle
> (immediately before "Suggest Improvements
On Sun, 2008-02-24 at 02:06 +, Raymond Wold wrote:
> ivan dubois wrote:
> > It does use GTP.
> >
> I mean, why do you have to download a client to run locally? Why can't
> you just use GTP directly against a socket?
Since gtp is typically implemented via console communication, there'd
still
I only back up along the path I took to reach the leaf node. When
reevaluating nodes, I re-check the number of simulations for all
children.
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-
On Mar 8, 2008, at 7:41 AM, Don Dailey <[EMAIL PROTECTED]> wrote:
Petr Baudis wrote:
Hi,
is there source code available for the binary CGOS client, please?
Get the Multi-platform starkit version of cgosGtp_kit.zip on the web
site.
Why not tell people to use the subversion repository
On Sat, 2008-03-08 at 17:02 +0100, Petr Baudis wrote:
> On Sat, Mar 08, 2008 at 04:56:16PM +0100, Moi de Quoi wrote:
> > Well, it depends on the server's policy, whether you are allowed to be
> > logged in more than once under the same name. (I can see no good reason
> > to allow it, but it's Don'
On Mar 10, 2008, at 8:07 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
Some programs hash each position and the tree is more abstract, no
pointers just positions leading to other positions by zobrist hash
keys in a hash table.
My scheme probably wastes a lot of space on nodes that are left
un
If the speed was lowered to 10k, I'd also participate. One of these
days, I'll speed up my engine...
Sent from my iPhone
On Mar 11, 2008, at 11:18 AM, Don Dailey <[EMAIL PROTECTED]> wrote:
Don Dailey wrote:
Petr Baudis wrote:
On Mon, Mar 10, 2008 at 06:57:07PM -0400, Don Dailey wrote:
On Mar 11, 2008, at 2:41 PM, Christoph Birk <[EMAIL PROTECTED]> wrote:
On Tue, 11 Mar 2008, Don Dailey wrote:
I am going to keep the 25k playouts running and add a 10k play-out
version of UCT. I want to establish a standard testing size so
that
Great! That way Jason can also participat
On Mar 12, 2008, at 2:17 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
Tim Foden wrote:
Don Dailey wrote:
I suggest
exactly 25,000 play-outs that we should standardize on.50,000
will
tax my spare computer which I like to use for modest CGOS tests.
If it is agreed, I will start a 25k te
I've been trying to participate in the 10k UCT thing but have not had
much luck...
My latest problem is the cgos gtp client... I have never gotten it to
work. In fact, I have been of off cgos ever since I switched to it! I
submitted two bug reports... One prevents use of multiple bots and
work this morning to use my laptop instead,
but then I hit the client bug.
Sent from my iPhone
On Mar 14, 2008, at 12:33 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
I'll try to take a look at it in the next couple of days. Today
may
not be possible but I will try.
- Don
Jas
1. which platform are you running on. How many bots?
2. Who is using the client with success?
Can I see your configuration file?
- Don
Jason House wrote:
Thanks Don!
There is no rush... I can download an old client from sf.net.
I'm just frustrated by all the little problems
On Mar 14, 2008, at 3:38 PM, Jason House <[EMAIL PROTECTED]>
wrote:
Bug 1914235 was on Ubuntu 7.10. The config file and error message
are included in the report.
This is correct.
Bug 1879326 was on 64-bit Ubuntu 7.10. The config file and error
message are included in the
On Mar 17, 2008, at 7:49 AM, Nick Wedd <[EMAIL PROTECTED]> wrote:
I have been discussing the Computer Go event with the organisers of
the European Go Congress, and have some news.
For those who plan to enter the Computer Go event(s) only, there
will be no fee. Entry for them will be free.
On Fri, 2008-03-28 at 11:20 +0100, Jaonary Rabarisoa wrote:
> - its rave and uct value are defined ( in this case we can
> compute the above score)
> - only the rave value is defined (in this situation the n(s,a)
> = 0 and the uct value is not defined)
> -
lly does it make sense to throw away all non visited node and
only consider the node that have a rave value first. Precisely use
the FPU but only for unvisited node that have Q_rave value.
On Fri, Mar 28, 2008 at 12:41 PM, Jason House <[EMAIL PROTECTED]
> wrote:
On Fri, 2008-03-28 a
Views fine on my iPhone. My only advice is to review the paragraph
after equation 3. For example, what the difference is of is unclear. I
was also unable to read the exponent in the equation for phi. It may
just be insufficient zoom...
Sent from my iPhone
On Apr 6, 2008, at 10:55 PM, David
On Apr 7, 2008, at 8:22 AM, Petr Baudis <[EMAIL PROTECTED]> wrote:
Hello,
On Sun, Apr 06, 2008 at 08:55:26PM -0600, David Silver wrote:
Here is a draft of the paper, any feedback would be very welcome :-)
http://www.cs.ualberta.ca/~silver/research/publications/files/MoGoNectar.pdf
you are
On Wed, Apr 9, 2008 at 10:54 AM, <[EMAIL PROTECTED]> wrote:
> I got excited about the free software sometime ago and bought a copy of
> Susie Linux. But the installation always hang up at some point and can never
> complete.
I too have had some horrible linux installation nightmares. Most of t
On Apr 9, 2008, at 6:00 PM, Rémi Coulom <[EMAIL PROTECTED]>
wrote:
Since most programs on CGOS are constant, I believe that Bayeselo
would be very difficult to beat.
That's partly a side effect of the current rating system...
Rémi
___
com
Two minor correction:
1. It looks like you translate the login names to formal bot names and
processing power. HBotSVN's real name is HouseBot.
2. HBotSVN crashed immediately on move 35
On Thu, Apr 17, 2008 at 5:37 AM, Nick Wedd <[EMAIL PROTECTED]> wrote:
> My report on the April KGS bot tournam
Please go to http://www.sourceforge.net/projects/cgos and add a
feature request (should be under "tracker" on the menu bar). This will
create a permanent record of the request, notify you of updates, and
send email notifications to CGOS maintainers.
Sent from my iPhone
On Apr 27, 2008, at
On Sun, 2008-05-04 at 14:22 +0100, Tom wrote:
> >From the website http://www.gokgs.com/tournInfo.jsp?id=380 and the fact
> that it hasn't started, I deduce that it starts at 1500 GMT, or about 40
> minutes time.
I think you mean 1h40m?
>
> On Sun, 2008-05-04 at 11:00 +0100, Nick Wedd wrote:
> >
Correction: HBotSVN was not reconfigured for speed in round 3. It was set
to use two search threads in round 4, and was compiled in debug mode for the
whole tournament. I apologize for the confusing PM's during the tournament
about this.
What is "HBotSVN's technique"? The game end protocol sa
On Wed, May 7, 2008 at 11:45 AM, Nick Wedd <[EMAIL PROTECTED]> wrote:
> In message <[EMAIL PROTECTED]>,
> Jason House <[EMAIL PROTECTED]> writes
>
> > Correction: HBotSVN was not reconfigured for speed in round 3. It was
> > set to use two search thread
On May 7, 2008, at 3:15 PM, Aloril <[EMAIL PROTECTED]> wrote:
On Wed, 2008-05-07 at 09:59 -0400, Jason House wrote:
Did you know that weakbot50k and idiotbot don't actually handle the
game end at all? Once both players pass, they switch to using gnu
go.
Source code for wea
On May 7, 2008, at 4:54 PM, Gian-Carlo Pascutto <[EMAIL PROTECTED]> wrote:
Evan Daniel wrote:
It is entirely within the power of the other bots to not lose on
time.
I am not sure that is true.
LeelaBot should be perfectly capable of playing about 12 moves per
second in the default config
ck
>
>
> Evan Daniel wrote:
> >
> > > On Wed, May 7, 2008 at 11:45 AM, Nick Wedd <[EMAIL PROTECTED]> wrote:
> > >
> > > > In message <
> > > > [EMAIL PROTECTED]>,
> > > > Jason House <[EMAIL PROTECTED]> writes
> >
My personal preferences would be to see the final section change its
title from "Probation" to "Losses in Cleanup" or some other title
addressing undesirable issue uncovered in this past tournament.
I have renamed this section to "Losses after Game Stop". Is this
reasonable?
As tournament
On Fri, 2008-05-09 at 16:04 -0700, Carter Cheng wrote:
> Hi,
>
> I have been lurking around in this group for sometime and recently have
> become interested in perhaps doing some coding and data gathering for
> constructing a simple go bot. I have a few basic questions I was wondering if
> peop
On Sat, 2008-05-10 at 07:01 -0700, Carter Cheng wrote:
> Thanks everyone for the responses. My go skills are somewhat limited (only
> 6-7kyu on KGS) so hopefully I am not belaboring the obvious.
>
> I have a few followup questions-
>
> 1) What mathematically is a seki? I know this is a local dr
On Sat, 2008-05-10 at 20:23 -0700, Carter Cheng wrote:
> 3) Also thanks for the links. I have taken a look at some of the code. I am
> not sure I will be writing in Java or D and most likely will be implementing
> the system in something like C++. I am worried about Java's speed since it's
> in
On May 12, 2008, at 4:33 PM, Gian-Carlo Pascutto <[EMAIL PROTECTED]> wrote:
Jeff Nowakowski wrote:
On Mon, 2008-05-12 at 21:14 +0200, Gian-Carlo Pascutto wrote:
But I still categorically object to the stance that it's the bots
or the programmers fault that it forfeits on time. As log as lag
I'm testing my bot on CGOS using pure UCT, no pondering, and 10,000
playouts per move. Can someone put up a comparable bot?
A while back, someone else made a similar request, and I discovered
that my bot had somehow broken. I've scoured for bugs and I believe I
have a functional implementat
y 13, 2008 8:51 AM
To: computer-go
Subject: Re: [computer-go] 10k UCT bots
On May 13, 2008, at 7:25 AM, Jason House wrote:
I'm testing my bot on CGOS using pure UCT, no pondering, and 10,000
playouts per move. Can someone put up a comparable bot?
I will
On May 13, 2008, at 12:57 PM, Carter Cheng <[EMAIL PROTECTED]>
wrote:
I am curious about the eye rule situation since I am at that stage
of my implementation of the board/playout code. currently I have
only implemented the basic rules of the game so that no illegal
moves are possible (no
On May 13, 2008, at 1:51 PM, Mark Boon <[EMAIL PROTECTED]> wrote:
On 13-mei-08, at 14:10, Álvaro Begué wrote:
What others do is the right thing to do. Your method will introduce
some biases.
Could you elaborate what bias it could lead to? I also do the same
as Jason. I did consider the pos
On May 13, 2008, at 3:02 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
Álvaro Begué wrote:
On Tue, May 13, 2008 at 2:28 PM, Mark Boon
<[EMAIL PROTECTED]> wrote:
On 13-mei-08, at 15:08, Jason House wrote:
The range of the random number is reduced by one after each failed
look
On May 13, 2008, at 3:20 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
I don't care much about it being noticeable. This thread is about
putting bots on CGOS that use a reproducible algorithm, to help
people
detect bugs in their implementations. As part of specifying what
these
bots do, we sh
That's a function of how smart your bot is. If you play until you only
have eye-filling moves, you can safely assume all of your opponent's
stones are alive, all your groups with two eyes are alive, and
everything else is dead. Note the asymetry - your opponent may use a
different strategy.
ning
options are illegal or fill one point eyes, then the logic is
relatively simple 99% of the time... All stones in atari are dead. Ko
messes that up if your opponent passes instead filling a ko.
2008/5/14 Jason House <[EMAIL PROTECTED]>:
That's a function of how smart y
On May 14, 2008, at 3:39 PM, Jeff Nowakowski <[EMAIL PROTECTED]> wrote:
The 10k refers to ten thousand playouts, not rank, and yes it's
9x9. As
for open source UCT, off the top of my head there's libego (C++) and
Orego (Java).
HouseBot is open source too (D). I really should add the random
On May 19, 2008, at 10:09 AM, Rémi Coulom <[EMAIL PROTECTED]>
wrote:
Hi,
I thought I should let you know that I have accepted to serve as
programmers representative on the board of the ICGA. That position
had been vacant for a while, and the ICGA offered me to be an
interim representati
On May 23, 2008, at 4:22 PM, Magnus Persson <[EMAIL PROTECTED]>
wrote:
Quoting Carter Cheng <[EMAIL PROTECTED]>:
I remember seeing this in the archive before but I forget the
actual results of the experiment. Does processing simulations in
groups of say 5-10 have any impact on the stren
Traveling there is out of the question for me. I'm also quite certain
I would not place well. I can contribute an executable if someone
wants to run my bot, they could keep any prize money.
Sent from my iPhone
On Jun 9, 2008, at 1:25 PM, Peter Drake <[EMAIL PROTECTED]> wrote:
We'd like to g
1, 3, and 5.
Last year's congress was closer to me, so 1 was not a factor. I went
to meet other programmers, but only one other committed to showing up.
Many others expressed interest but were not there.
Sent from my iPhone
On Jun 13, 2008, at 12:59 AM, Peter Drake <[EMAIL PROTECTED]> wrot
Is it possible to show the board for the round 1 open division game? You
refer specifically to a choice made at move 60...
Also, the processor description for HBotSVN is incorrect. Rounds 1-6 were
through a virtual machine on a box with a 2GHz Intel Core Duo.Rounds 7-9
was running native on
I can provide a pre-built executable for my bot if I know the target
hardware and who to give it to.
Sent from my iPhone
On Jun 18, 2008, at 1:09 PM, Peter Drake <[EMAIL PROTECTED]> wrote:
For the tournament at the US Go Congress:
Please remember that you can send someone else to run your p
On Thu, Jun 26, 2008 at 11:20 AM, <[EMAIL PROTECTED]> wrote:
> You can use a windowed average where the window is a fixed fraction (say
> the last third) of the total times the move was made. I have often used an
> IIR filter and have never yet been able to prove that it actually helped. If
> I co
hould look
nearly identical to typical UCT code...
UCB = w + (a/2)*sqrt(log(...)/n)
On Jun 26, 2008, at 1:40 PM, "Jason House"
<[EMAIL PROTECTED]> wrote:
On Thu, Jun 26, 2008 at 11:20 AM, <[EMAIL PROTECTED]> wrote:
You can use a windowed average where the window is
I tendto like exponentially weighted moving averages when I need a
fading memory. That keeps storage simple, updates fast, and nearly the
same effect
i.e.
wins = 0.99*wins + latest_result
sims = 0.99*sims + 1
Sent from my iPhone
On Jun 26, 2008, at 2:40 PM, "Ivan Dubois" <[EMAIL PROTECTED]>
is
-Original Message-
From: Jason House <[EMAIL PROTECTED]>
To: computer-go
Sent: Thu, 26 Jun 2008 2:00 pm
Subject: Re: [computer-go] UCB/UCT and moving targets
I probably exceeded my math quota already, but I should add that
UCB = w + k*sqrt(P)
If k=a*sqrt(log(...)), this becomes
On Jun 26, 2008, at 6:03 PM, [EMAIL PROTECTED] wrote:
> -Original Message-
> From: Jason House <[EMAIL PROTECTED]>
> On Jun 26, 2008, at 3:23 PM, [EMAIL PROTECTED] wrote:
Cool! Now for the cases where I'd want a Kalman filter, I'd need it
to predict
Sent from my iPhone
On Jul 2, 2008, at 12:37 PM, Jason Galbraith <[EMAIL PROTECTED]> wrote:
I've been looking at RAVE (Rapid Action Value Estimate), which MoGo
uses. The
score of states during simulation is stored in state-action pairs,
which are
all updated with the playouts, rather than
Ooh... I'd register for the tournament if I had an operator... I'll
need to double check operation on Windows Vista.
Running my bot is easy. I can provide the configuration file for kgsGtp
Sent from my iPhone
On Jul 7, 2008, at 7:55 AM, [EMAIL PROTECTED] wrote:
As I'm sure all those interes
I wouldn't want to overload volunteer operators. I can bow out to make
room for other bots.
On Jul 7, 2008, at 10:36 AM, "Gian-Carlo Pascutto" <[EMAIL PROTECTED]>
wrote:
Because everything should run automatically with kgsGTP, I actually
see little reason why one operator can't operate mult
On Jul 7, 2008, at 3:31 PM, Nick Wedd <[EMAIL PROTECTED]> wrote:
In message <[EMAIL PROTECTED]>, Gian-Carlo Pascutto <[EMAIL PROTECTED]
> writes
Jason House wrote:
I wouldn't want to overload volunteer operators. I can bow out to
make room for other bots.
Nah, y
On Tue, 2008-07-08 at 16:00 -0600, Martin Mueller wrote:
> Hello all,
>
> as Rémi has pointed out, we have decided to make our Monte-Carlo Tree
> Search based program available as open source with an LGPL licence.
> This program, now called Fuego, has evolved from the Explorer source
> code.
I tracked down a rare hang/crash in my bot and I'm curious how others
handle this.
I use simple ko state as part of my hash lookup, but I don't use super
ko. I can't store the whole graph history because then there would be
no transpositions at all. I can't really update legal moves to excl
he game takes another path.
On Jul 11, 2008, at 9:03 AM, Jason House wrote:
I tracked down a rare hang/crash in my bot and I'm curious how
others handle this.
I use simple ko state as part of my hash lookup, but I don't use
super ko. I can't store the whole graph hist
;m not sure how big the
whole tree was, but it was at least 20 ply
The moves here will probably finish the playout (one way or another)
before hitting the maximum move threshold, so the playout will not
be aborted but will update the tree.
On Jul 11, 2008, at 9:39 AM, Jason House wrote:
mber of
moves in a playout; abort the playout if you reach this threshold.
On Jul 11, 2008, at 9:03 AM, Jason House wrote:
I tracked down a rare hang/crash in my bot and I'm curious how
others handle this.
I use simple ko state as part of my hash lookup, but I don't use
super ko.
Actually, I prefer Linux. While I can build/run on Windows, I do not
use it at home.
Sent from my iPhone
On Jul 12, 2008, at 6:26 PM, Peter Drake <[EMAIL PROTECTED]> wrote:
I believe all of the programs that need operators (FirstGo,
HouseBot, and Leela) all run on Windows. I hope someone wi
Please list HouseBot for both board sizes. Just like Remi, this is
subject to operator availability.
Sent from my iPhone
On Jul 17, 2008, at 9:53 AM, Nick Wedd <[EMAIL PROTECTED]> wrote:
The European Go Congress (see http://egc2008.eu/en/congress/
index.php) will be held in Leksand, Sweden f
On Jul 17, 2008, at 12:29 PM, "David Fotland" <[EMAIL PROTECTED]
games.com> wrote:
It irks me a little that Linux people refuse to consider porting their
programs to Windows :) With cygwin, it's pretty easy to port Linux
programs. Since these programs work on CGOS they have a gtp
interface,
On Jul 17, 2008, at 1:12 PM, "Álvaro Begué" <[EMAIL PROTECTED]>
wrote:
On Thu, Jul 17, 2008 at 12:55 PM, Jason House
<[EMAIL PROTECTED]> wrote:
[...]
I don't own a computer with Windows on it, and that adds significant
headache. It's hard to convince friends/w
On Jul 20, 2008, at 9:10 AM, "Álvaro Begué" <[EMAIL PROTECTED]>
wrote:
On Sun, Jul 20, 2008 at 3:40 AM, Rémi Coulom <[EMAIL PROTECTED]
r> wrote:
Rybka 3 has Monte-Carlo evaluation:
http://www.chessbase.com/newsdetail.asp?newsid=4772
If I understand the release note correctly, Monte Carlo An
Sent from my iPhone
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
1pm in which timezone? Which room & user name(s) will be used on KGS?
Sent from my iPhone
On Jul 21, 2008, at 5:04 PM, Peter Drake <[EMAIL PROTECTED]> wrote:
(This is from the US Go Congress to be held in Portland, Oregon.)
On Thursday, August 7, at 1:00 PM, Kim MyungWan 8p will take on
MoG
I'm starting heavy plyouts, with variable move selection weights. The
proximity heuristic seems like a performance killer since most weights
would require an update with each move.
How do others handle this? Is proximity reserved for the search tree?
How do others store data for rapid lookup
ssage-
From: Jason House <[EMAIL PROTECTED]>
To: computer-go
Sent: Mon, 21 Jul 2008 7:32 pm
Subject: [computer-go] Incremental move weights
I'm starting heavy plyouts, with variable move selection weights.
The proximity heuristic seems like a performance killer since most
weights
;s method to be slower.
Is it stronger?
My MoGo style heavy playouts are about 4 times slower than my light
playouts.
That's not too bad, considering...
Were there any tricks to minimize the slowdown?
-Original Message-----
From: Jason House <[EMAIL PROTECTED]>
To: comp
On Jul 21, 2008, at 10:26 PM, "Álvaro Begué" <[EMAIL PROTECTED]>
wrote:
On Mon, Jul 21, 2008 at 7:32 PM, Jason House
<[EMAIL PROTECTED]> wrote:
I'm starting heavy plyouts, with variable move selection weights. The
proximity heuristic seems like a performance killer
Additionally, I noticed the update time is labeled UCT instead of UTC
Sent from my iPhone
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
I now tracked down another super ko bug. I'm curious if anyone has
worked out which infinite cyles can occur in random playouts that avoid
eye-fills and suicides. Additionally, how do people handle this type of
situation in playouts? I believe libego checks game length and assigns
"no result" if
.html
David
-Original Message-
From: [EMAIL PROTECTED] [mailto:computer-go-
[EMAIL PROTECTED] On Behalf Of Jason House
Sent: Tuesday, July 22, 2008 8:19 PM
To: computer-go@computer-go.org
Subject: [computer-go] Super ko in random playouts
I now tracked down another super ko bug. I'
On Jul 24, 2008, at 1:45 PM, John Stogin <[EMAIL PROTECTED]> wrote:
It seems that the UCB1-Tuned algorithm uses variance from a normal
distribution, however we believe it would be more optimal to use
variance from a beta distribution. Has any work been done in this
area? Are people still us
Is gnu go a weak bot? I suspect the weak bots and gnu go share the
common characteristic that they don't resign. I looked at a few games
that were lost and it says "illegal move to occupied point".
On Fri, 2008-07-25 at 21:40 -0400, John Fan wrote:
> Seems it has a serious bug on end game agains
Personally, I think the next big strength jump would come from combining
localized searches/sequences with the global search's MC playouts.
I know my project is still playing catch-up with the stronger programs.
I always recommend to new developers that they join forces with other
developers to re
On Jul 28, 2008, at 5:04 AM, Darren Cook <[EMAIL PROTECTED]> wrote:
Personally, I think the next big strength jump would come from
combining
localized searches/sequences with the global search's MC playouts.
Curiously, my guess is the opposite: using UCT as the node
evaluation in
a more tr
I now see kartoffel2 on CGOS. The first game was a loss from never
playing a stone, but has since won every game and is rapidly climbing
in rank
Sent from my iPhone
On Jul 25, 2008, at 10:29 PM, Jason House
<[EMAIL PROTECTED]> wrote:
Is gnu go a weak bot? I suspect the weak bo
Option C sounds best to me too.
Sent from my iPhone
On Jul 28, 2008, at 11:58 AM, Nick Wedd <[EMAIL PROTECTED]> wrote:
I still haven't fixed a date for the August KGS bot tournament.
The problem is, on Monday August 4th I am setting off for the EGC in
Sweden. Many strong European players a
Maybe we should approach wms about using KGS. Rank and pairings could
be computed separately. Once upon a time, there was a page that
computed 9x9 bot ratings
Sent from my iPhone
On Jul 30, 2008, at 3:16 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
There seems to be something special about 9x
he does it later, I
would probably prefer it to CGOS and would use it instead.
- Don
On Wed, 2008-07-30 at 15:35 -0400, Jason House wrote:
Maybe we should approach wms about using KGS. Rank and pairings could
be computed separately. Once upon a time, there was a page that
computed 9x9 bot rati
same player playing it 20 games
in a
row and so on. If you can get all that to happen without WMS
support,
then I'm definitely interested.
- Don
On Wed, 2008-07-30 at 18:20 -0400, Jason House wrote:
Where there's a will, there's a way. It may not be hard to use
to prefer 19x19.
- Don
On Thu, 2008-07-31 at 08:05 -0400, Jason House wrote:
On Jul 30, 2008, at 6:55 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
I think someone already has a website somewhere where they try to
rank
bots based on KGS games.
I'm pretty sure the site stop
On Jul 31, 2008, at 12:20 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
I am working on a plan to possibly be able to run 2 boardsizes on Dave
Dyers boardspace site. If this plan works out, obviously 9x9 is
very
popular and we will keep it. The only questions is what should the
other board s
On Jul 31, 2008, at 12:45 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
We put up a 7x7 site a while back and I thought it would get heavy
traffic, but instead almost no interest.
I don't remember ever hearing about it. I'd use it for faster testing.
On Thu, 2008-07-31 at 12
On Thu, 2008-07-31 at 15:50 -0700, Peter Drake wrote:
> I know we had this conversation recently, but I just can't seem to get
> my head around writing a ladder reader. What, exactly, does the ladder
> reader do?
>
> Our approach was to read out ladders involving the last stone played.
> In
On Aug 1, 2008, at 12:54 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
For time controls, I have changed my previous position, I think I
prefer somewhat faster time controls. There are disadvantages but
almost many advantages. The foremost advantages is that I believe it
encourages participation
What's the connection info for the 3 new servers? I looked at the
boardspace page, but it was out of date
Sent from my iPhone
On Aug 2, 2008, at 9:09 AM, Don Dailey <[EMAIL PROTECTED]> wrote:
Ok, it seems to be playing games now. Somehow the database was
corrupted so I just removed it so
On Aug 2, 2008, at 4:31 AM, Gunnar Farnebäck <[EMAIL PROTECTED]>
wrote:
It's often a good idea to bias capturing moves in the playouts,
regardless whether it's a ladder or not. This would result in those
stones being captured in most simulations.
What method do people use for finding capture
I have to withdraw from this tournament. I don't have a windows
computer, and getting access to one with the ability to install tools
has been tougher than anticipated.
On Thu, 2008-07-17 at 14:53 +0100, Nick Wedd wrote:
> The European Go Congress (see http://egc2008.eu/en/congress/index.php)
>
ug 5, 2008 at 9:28 AM, Don Dailey <[EMAIL PROTECTED]> wrote:
> On Tue, 2008-08-05 at 08:30 -0400, Jason House wrote:
> > I have to withdraw from this tournament. I don't have a windows
> > computer, and getting access to one with the ability to install tools
> > has
gnu based compiler? Do you
> think it would work on either?
I was assuming it would work with either, but now I'm not so sure. At this
point, I'd want to try to use GDC. It may be that I have to submit a
compiler bug report to digital mars.
> - Don
>
>
>
> On T
Sent from my iPhone
On Aug 5, 2008, at 9:45 AM, terry mcintyre <[EMAIL PROTECTED]>
wrote:
- Original Message
From: Don Dailey <[EMAIL PROTECTED]>
I misunderstood Jason's email. He is trying to compile his program
to
run on windows and it's written in D. You cannot log int
ues. :)
> > It will turn out later today whether it works or not, but
> > booting linux from a USB-stick worked fine for Gunnar
> > Farnebäck.
> >
> >
> > Best regards
> > Basti Weidemyr
> > sestir
&g
ed. Sadly, it is
nearly impossible to build from scratch on Windows.
- Don
On Tue, 2008-08-05 at 15:19 +0200, Urban Hafner wrote:
-BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Jason House wrote:
| I have to withdraw from this tournament. I don't have a windows
| computer, and
I hit this problem long ago when CGOS was young. The fix at that time
was to send the estimated time until the next round. Eventually, that
cluttered the logs and was removed from the server code.
Sent from my iPhone
On Aug 9, 2008, at 9:19 AM, Don Dailey <[EMAIL PROTECTED]> wrote:
Ben,
I
Sent from my iPhone
On Aug 9, 2008, at 11:46 AM, Don Dailey <[EMAIL PROTECTED]> wrote:
On Sat, 2008-08-09 at 10:42 -0400, Jason House wrote:
I hit this problem long ago when CGOS was young. The fix at that time
was to send the estimated time until the next round. Eventually, that
clu
1 - 100 of 660 matches
Mail list logo
