On Dec 5, 2007 4:44 AM, Lars [EMAIL PROTECTED] wrote:
2. I had run the algorithm on 400 games (including handicap-games) from
the same game-records source Remi used (Section 3.2), but i used an
other month. I concidered only 3x3 shape-patterns and simple non-shape
pattern including
On Wed, 2007-12-05 at 17:52 -0800, terry mcintyre wrote:
I just finished a few 19x19 games with the freely downloadable version
of Mogo, and noticed that Mogo loses a fair number of points in the
endgame.
This is typical of MC engines...
If it's winning by 100.5 points, it'll lose 100 points
The summary looks good to me.
Just to clarify HouseBot's round 3 performance...
HouseBot would normally resign lost games, but it has a check in there
that prevents resignation when it has not thought deeply enough about
every move. 19x19 is such a big board that it does not hit that
threshold
On 12/4/07, Chris Fant [EMAIL PROTECTED] wrote:
Where can one play the latest versions of MoGo or other, similarly
strong programs?
But Mogo is now a free program.You can get a copy, find some good
hardware and play at 9x9 and 19x19.
But the released version is probably not the
On 12/4/07, Chris Fant [EMAIL PROTECTED] wrote:
What I consider more of an issue is that MoGo seems to be very
sensitive to (undocumented) configuration options. Such issues
probably exist with all engines. It'd probably be smarter to set up a
day where strong bots would connect to CGOS
Maybe it should be an official tournament on KGS. We should probably
make it invitation only for bots and open to 1d+ from KGS. For
invitation, maybe it should be 2200+ ELO bots?
Looking at http://cgos.boardspace.net/9x9/standings.html, that seems to be:
GreenPeep (2550)
Zen (2472)
MoGo (not
On Tue, 2007-12-04 at 18:23 -0800, David Doshay wrote:
What would get YOU to bring your program to the Congress?
Free trips back and forth on a teleporter. Or at least 3 unlikely
events (out of the US Go Congress's control) to occur.
It's probably be more viable for people to send their
After the conference, will the papers presented be publicly available?
On 12/3/07, Martin Mueller [EMAIL PROTECTED] wrote:
I forward this call for papers since it may be of interest to some of
you.
Martin
Call for Papers:
On Fri, 2007-11-30 at 11:04 +0100, Rémi Coulom wrote:
Hi,
I thought it may be a good idea to decide on a day when everybody would
connect to CGOS. Many programmers do not wish to let their program play
forever on the server, so it may be interesting to decide on a day to
connect, so
On Fri, 2007-11-30 at 14:51 -0500, Don Dailey wrote:
I don't have a problem with a special CGOS day or week, but I would
prefer to see an effort to get CGOS seeded with more variety at ALL
times. Part of the convenience of having CGOS is that you can test a
change at any time.
One
On Wed, 2007-11-28 at 14:21 -0500, Don Dailey wrote:
For the time being it's still here.
SF.net support requests for 9x9 should now work.
Support requests has two groups
server down: 9x9 (auto-e-mails Don)
server down: 19x19 (don't use yet - Must get Olivier on sf.net)
On Wed, 2007-11-28 at 04:08 +0200, Harri Salakoski wrote:
I use pure java solutions when it is possible. plain E3 atleast don't seem
work, tried many other combinations also without success.
t. harri
According to GTP, the simplest correct response is = G3\n\n
On Tue, 2007-11-27 at 19:00 -0800, Phil Garcia wrote:
There are a few advantages to implementing the protocol within your
program. You can implement custom actions between commands, like
additional setup commands, and support for pondering.
I'm probably missing something, but I don't see how
On Sat, 2007-11-24 at 08:38 -0700, [EMAIL PROTECTED] wrote:
To follow up on this thread, I have been playing with
psuedo liberties a bit, and here is my solution.
* I use 2 vectors of values. The first is used for
storing the pseudo liberty values. The second lists has
all 1*, 2*, 3*,
On Thu, 2007-11-15 at 15:20 -0500, Eric Boesch wrote:
John and Jason's optimization suggestions are both good, but they
point in different directions. (Of course, John had a complete
solution to begin with.) I have a 64-bit machine, and in that case I
think that the bitmask approach, with
On Sat, 2007-11-24 at 10:36 -0700, [EMAIL PROTECTED] wrote:
Since 160,000 2*(19*19)^2, a value well below the various possible
sums of squares, I have to ask what additional work you've done to prove
that the overlap doesn't cause problems?
160,000 is greater than (19 * 19 + 1)^2, so
On Nov 21, 2007 1:18 PM, Petr Baudis [EMAIL PROTECTED] wrote:
On Thu, Nov 22, 2007 at 12:04:53PM +1800, Nick Apperson wrote:
right... well C++ does have this using virtual methods. I meant to add
that
part.
I'm sorry, I still don't get this - what do virtual methods have to do
with
On Nov 20, 2007 1:55 PM, Jacques Basaldúa [EMAIL PROTECTED] wrote:
PD I don't know who is in charge of CGOS, Don, Olivier or Jason.
If this is not the right place to post CGOS incidents, tell us where.
Don - 9x9 CGOS, boardspace website
Olivier - 19x19 CGOS
Jason - sourceforge website
As
CGOS is now up on sourceforge at http://sourceforge.net/projects/cgos
For initial content, you'll find...
* A link to http://cgos.boardspace.net/ as the homepage
* A wiki page http://cgos.wiki.sourceforge.net/ that is really just a
copy/paste of stuff from the homepage and spread across a few
On Sun, 2007-11-18 at 03:06 -0500, Jason House wrote:
* A mailing list, [EMAIL PROTECTED], intended for
all cgos related traffic that should be off the computer-go mailing list
(such as automated commit messages)
For those interested in subscribing to the mailing list, please go to
https
I think CGOS has been down for at least 2 days...
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
On Nov 15, 2007 9:40 AM, Chris Fant [EMAIL PROTECTED] wrote:
Based off the posts of others, it seems like creating new children of a
leaf
after 50 sims gives extra strength (smaller values yield weaker bots at
10k
sims)
I think it's just to save memory.
Take a look at
On Nov 15, 2007 7:40 AM, Petr Baudis [EMAIL PROTECTED] wrote:
Thanks a lot! I'm doing that now and while the ranks are not yet stable,
they are all only slightly above 1050 now already. :-( (Even the
variants with extra domain-specific knowledge.) I guess I still have
some bugs there.
Here
On Wed, 2007-11-14 at 19:27 +0100, Petr Baudis wrote:
Hi,
is anyone successfully using the kgs-chat GTP command in games?
I cannot get kgsGtp to send me the command when I make a comment inside
a game (as the bot's opponent). I receive the command when
I private-message the bot. Is there
Your post is very interesting. The tail part of it seems mangled.
On Wed, 2007-11-14 at 20:37 -0500, Eric Boesch wrote:
. Any coordinate is just a sequence of bits. Each bit can be encoded
separately. So the problem reduces to how to encode a single bit (0 or
1) so that the sum of up to 4
Nice work!
I've convinced myself that what you're doing will work. If you
sacrifice the two least significant bits for zero padding, you can avoid
code_sum % pseudoliberty_count == 0 check.
On Wed, 2007-11-14 at 21:02 -0500, Eric Boesch wrote:
Sorry, I didn't mean to send that one yet. I
On Nov 13, 2007 10:36 AM, Ian Osgood [EMAIL PROTECTED] wrote:
I like Forth. I got excited about UCT around the time of the Computer
Olympiad and wrote a bitmap-based 9x9 program. What is the general
impression on bitmap vs. mailbox board representations for Monte
Carlo readouts?
I never
I too would love to see this feature. Besides figuring out how to do this
(technically), is there any concern about bots dumping too much
information? Would wms care about significantly larger file sizes for games
against chatty bots?
In testing my bot, I find the perceived winning percentage
On Nov 13, 2007 11:23 AM, Heikki Levanto [EMAIL PROTECTED] wrote:
There are pathological cases where this has to loop many times, flood
filling
the one liberty to a long chain of stones, but those should be rare.
This was my big turn-off. I would expect the average case in mid-game to
On Nov 13, 2007 11:31 AM, Ian Osgood [EMAIL PROTECTED] wrote:
On Nov 13, 2007, at 7:46 AM, Jason House wrote:
On Nov 13, 2007 10:36 AM, Ian Osgood [EMAIL PROTECTED] wrote:
I like Forth. I got excited about UCT around the time of the Computer
Olympiad and wrote a bitmap-based 9x9
On Nov 13, 2007 1:51 PM, John Fan [EMAIL PROTECTED] wrote:
Obviously I need to fix my program to reset the time controls on the
time_settings command, and should not always expect a time_left
command after the time_settings command on the first move.
Just a small word of warning - KGS's
On Nov 13, 2007 2:48 PM, Petr Baudis [EMAIL PROTECTED] wrote:
I'm now somewhat torn. The speedup from using pseudo-liberty counts
could be huge, estimating from my profiling. On the other hand, it would
be very useful to still be able to quickly check if a group is in atari
- it looks like if
On Nov 13, 2007 3:13 PM, Imran Hendley [EMAIL PROTECTED] wrote:
Looking at my code I first check if the number of pseudoliberties is
less than or equal to 2 (this is necessary but not sufficent for a
string to be in atari given the way I compute pseudoliberties), which
is very fast (it just
On Nov 13, 2007 3:32 PM, John Tromp [EMAIL PROTECTED] wrote:
Is there any known way to get the best of the both worlds? :-)
Yes, you can generalize pseudoliberties by extending them
with another field, such that if the (summed) pseudoliberty field
is between 1 and 4, then the other (summed)
On Nov 13, 2007 3:22 PM, Nick Apperson [EMAIL PROTECTED] wrote:
I'd also say that Lisp seems like a great choice. I'm happy to see that
C++ has been adding support for all the metaprogramming because that is what
is going to really matter in the future I think and it is why Lisp is such a
On Nov 13, 2007 3:57 PM, Petr Baudis [EMAIL PROTECTED] wrote:
On Tue, Nov 13, 2007 at 03:32:03PM -0500, John Tromp wrote:
On Nov 13, 2007 2:48 PM, Petr Baudis [EMAIL PROTECTED] wrote:
I'm now somewhat torn. The speedup from using pseudo-liberty counts
could be huge, estimating from my
On Nov 13, 2007 4:05 PM, Jason House [EMAIL PROTECTED] wrote:
You're right, that would work.
PS: I think that last one should be:
group.pseudlibs = 4 is_liberty(group, as_coord(group.xyzzy
/group.pseudlibs))
I take that back... Or at least partially. It won't work if it's possible
On Nov 13, 2007 5:01 PM, Don Dailey [EMAIL PROTECTED] wrote:
I must be a dinosaur - at least a minimalist - but I don't understand
the big deal about library support that has been mentioned a lot here.
My Go program doesn't use any libraries except the standard C
libraries.Since it's
To put a bot on KGS for general play, you simply need to set up a login ID
and have kgsGtp use it.
On Nov 9, 2007 9:35 AM, Joshua Shriver [EMAIL PROTECTED] wrote:
What are the rules for putting bots on kgs? Do you have the author or
can anyone put up a gnugo bot?
-Josh
On Nov 9, 2007 1:06 PM, Chris Fant [EMAIL PROTECTED] wrote:
Do you know of any reasons why it would not be granted to the program
author?
It may be possible to have a request slip through the cracks. I've
submitted e-mail requests to [EMAIL PROTECTED] and gotten no response.
Back in the
CGOS is currently down.
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
I've been thinking about the same feature. I wasn't specifically thinking a
hyperlink, but certainly a string with far more than 18 characters. Another
candidate is to have commands that query the engine and display it as
comments in the games
On Nov 7, 2007 2:18 AM, Heikki Levanto [EMAIL
is 6.5
Bot A is declared the winner.
If such a competition existed, would others be interested in competing?
On Nov 6, 2007 10:48 AM, Jason House [EMAIL PROTECTED] wrote:
On Nov 6, 2007 10:30 AM, Lars Schäfers [EMAIL PROTECTED] wrote:
By the way: a 9x9 CGOS server using japanese rules... I have
On Wed, 2007-11-07 at 14:34 -0800, Christoph Birk wrote:
What is the difference between 'hb-678-UCTRAVE-10k' and 'hb-675-UCT-10k'.
It's probably obvious, but UCTRAVE uses RAVE instead of just (tuned)
UCT.
___
computer-go mailing list
It's probably better to use the GTP version command instead of the name
command.
On Thu, 2007-11-08 at 04:11 +0100, Heikki Levanto wrote:
On Wed, Nov 07, 2007 at 03:26:37PM -0800, Christoph Birk wrote:
CGOS already uses the 'name' feature. You send it (along with a
password) at login.
No,
On Nov 6, 2007 4:34 PM, Don Dailey [EMAIL PROTECTED] wrote:
Territory scoring doesn't make the game end any sooner, it just
penalizes you for not doing so.
Right. In close games, the decision to pass is non-trivial. If protecting
against an invasion causes a loss, then the invasion must be
It sounds like you're frustrated, so here's a few lines of C code
that'll do about what you describe. Note that the use of large values
for the standard deviation will make the code go very slow from
repetitive looping. The divide by 10 is to make it not be too slow with
a degree of randomness
What about seki situations?
On Nov 5, 2007 1:41 PM, [EMAIL PROTECTED] wrote:
It takes some tricky analysis to work out the Japanese score, due to
uncertainty about life/death; likewise it's not easy for a program to
recognize when moving is no longer to its advantage.
How about bringing in
I'd like to implement RAVE as described in [1]. I believe I have a very
clear understanding of how to do this at the leaves of the UCT search tree.
What I'm not sure about is how to apply RAVE results higher in the UCT
tree. Does anyone have any experience with this that they're willing to
I'd love to CGOS use something like sourceforge for tracking feature
requests, bugs, and even source code.
On 11/1/07, Olivier Teytaud [EMAIL PROTECTED] wrote:
I have re-launched the cgos 19x19 web-updater for
http://www.lri.fr/~teytaud/cgosStandings.html.
I suggest that bug-reports and
This craziness was subject of some long threads recently. a1 notation
starts in the lower left and skips i. pd notation starts in the upper
left.
On 11/1/07, Joshua Shriver [EMAIL PROTECTED] wrote:
I'm writing a SGF parse and was wondering, the moves are listed as
[pd] [dd], instead of a1
On 11/1/07, Joshua Shriver [EMAIL PROTECTED] wrote:
Aye, saw some mentioning of it during the XML/sgf thread...
That's exactly it.
So SGF starts and top left corner and skips I as well? Little
confusing but a little code can always remap it.. Thanks :)
SGF does not skip i.
On 10/29/07, Christoph Birk [EMAIL PROTECTED] wrote:
On Mon, 29 Oct 2007, Christoph Birk wrote:
myCtest-10k-UCT: 1 random playouts guided by a UCT search (1350 ELO)
* nodes are expanded after 50 runs through them
* UCT_score = win_ratio + 0.5 *
On Thu, 2007-11-01 at 17:05 -0400, Don Dailey wrote:
The source code is included - even though you probably don't realize
it.There is a utility that will unpack the kit and reveal the source
code. Then you can fix it, pack it back up and run it.Google for
sdx.kit and tclkit and
On Thu, 2007-11-01 at 19:02 -0400, Don Dailey wrote:
cgosview -server server_name -port portnum -games 1,2,3,4,5
What about the sentinel file?
___
computer-go mailing list
computer-go@computer-go.org
Jason House wrote:
On Thu, 2007-11-01 at 17:05 -0400, Don Dailey wrote:
The source code is included - even though you probably don't realize
it.There is a utility that will unpack the kit and reveal the source
code. Then you can fix it, pack it back up and run it.Google
Jason House wrote:
When will the info on http://cgos.boardspace.net/ be updated with the
new instructions and updated links? I just tried downloading the viewer
and it was old.
On Thu, 2007-11-01 at 19:02 -0400, Don Dailey wrote:
I just updated the current viewer to version
I understand a lot of the burden that's on Don to maintain CGOS. I
think that using http://www.sourceforge.net could lower a lot of the
maintenance work for him. Here's the individual features that I know
would help:
* Wiki page - Allows the community to maintain the web page, adding
minor
On Thu, 2007-11-01 at 20:38 -0400, Joshua Shriver wrote:
I have my own webserver and would be willing to host an OSS project like cgos.
Sourceforge is nice, but I thought one of the funky rules was that you
had to assign the copyrights to the FSF or something.
I don't think this is true. I
if it was sourceforge, gnu, or what...
-Josh
On 11/1/07, Jason House [EMAIL PROTECTED] wrote:
On Thu, 2007-11-01 at 20:38 -0400, Joshua Shriver wrote:
I have my own webserver and would be willing to host an OSS project like
cgos.
Sourceforge is nice, but I thought one of the funky rules was that you
On 10/30/07, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
-Original Message-
From: Jason House [EMAIL PROTECTED]
To: computer-go computer-go@computer-go.org
Sent: Mon, 29 Oct 2007 3:00 pm
Subject: Re: [computer-go] BOINC
On 10/29/07, [EMAIL PROTECTED] [EMAIL PROTECTED
On 10/30/07, Heikki Levanto [EMAIL PROTECTED] wrote:
It's really a function of the perceived chances of winning. When
behind,
it'll play bold moves since it's the only real way to win. An MC bot
that
is behind in endgame (even if by 1/2 point) plays so wildly, it
frequently
loses all
How can I find and view older games on CGOS once they scroll off of
http://cgos.boardspace.net/9x9/standings.html? I know I can recreate URL's
such as http://cgos.boardspace.net/9x9/SGF/2007/10/29/176900.sgf with some
pain and download all the games for the day(s) of interest. My problem is
then
Just an observation... On the cross-table page, the back to standings link
is incorrect. It should point to
http://www.lri.fr/~teytaud/cgosStandings.html
On 10/29/07, Don Dailey [EMAIL PROTECTED] wrote:
I don't see Mogo on the server?Where is Mogo?
However CrazyStone is there to
For all of us in the bot-making kiddie pool, it's exceptionally helpful to
have reference implementations of basic algorithms running on the server.
When playing with AMAF, I found the reference AMAF bots very helpful. Now
that I'm playing with UCT, references for UCT would be helpful.
I have
29, 2007, at 8:39 AM, Jason House wrote:
For all of us in the bot-making kiddie pool, it's exceptionally
helpful to have reference implementations of basic algorithms
running on the server. When playing with AMAF, I found the
reference AMAF bots very helpful. Now that I'm playing with UCT
On 10/29/07, Christoph Birk [EMAIL PROTECTED] wrote:
I'm not sure if my engine will support 50k simulations without
running out of time in long games. Is it possible to do 10k?
no problem. I will start 'myCtest-10k-UCT' later today.
Christoph
How does this compare to myCtest-10k
On 10/29/07, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
milestone 1: All network-nodes compute pure Monte-Carlo (no search tree)
scores for the possible moves, the scores are combined centrally to pick the
move. It's easy, it will wring out the system, and the bandwidth is low. The
playing
On 10/29/07, steve uurtamo [EMAIL PROTECTED] wrote:
As results from children get aggregated, the parent node can repartition
what fraction of its
resources to dedicate to each subtree.
um, doesn't this mean sending out messages to every child for every
repartitioning?
I was thinking
On 10/29/07, Christoph Birk [EMAIL PROTECTED] wrote:
On Mon, 29 Oct 2007, Jacques Basaldúa wrote:
This can also be done by the programmers. E.g. If CrazyStone is too
strong,
Rèmi can introduce a CrazyStoneH3 which passes 3 times
at the beginning. But not at the first move, to avoid smart
While I don't own a copy of Many Faces (and probably won't for a while),
what you suggest would be a big help to my use of it.
On Sun, 2007-10-28 at 09:27 -0700, David Fotland wrote:
Would anyone be interested in a highly configurable version 11 with gtp
interface?
Version 11 has a set of
I think I agree with Ed, but I also see and appreciate the arguments you
give as well. I also like to watch CGOS games to evaluate my bot, but 1
hour per game is somewhat past my attention span (for real go games
too).
In all likelihood, I'll probably stick to 9x9 for most of my stuff
(largest
On Sun, 2007-10-28 at 17:05 -0400, Don Dailey wrote:
Hi Dave,
Two servers is easy, but 1 server is better.The plan is that I will
combine fast and slow games into one server.When a slow round is
complete, there will be a delay while the current fast round is being
completed.
gtp has specific support for handicap games. If we do handicap, I'd
prefer to see the server use those specialized commands.
On Sun, 2007-10-28 at 17:21 -0400, Don Dailey wrote:
What if one program agreed to moving at a1 on the first move? Would
this simulate a handicap pretty well?
You
, neither did my option #2 :)
- Don
Jason House wrote:
On Sun, 2007-10-28 at 17:05 -0400, Don Dailey wrote:
Hi Dave,
Two servers is easy, but 1 server is better.The plan is that I will
combine fast and slow games into one server.When a slow round is
complete
cgosview can take a while to load even on fast connections. There's a
slight chance you're not being patient enough.
PS: For ports, I usually find a packet sniffer helpful for such things
(ethereal/wireshark is available for free). I assume someone can give a far
better answer.
On 10/26/07,
is the right setting)
On 10/19/07, Jason House [EMAIL PROTECTED] wrote:
I've only recently implemented my first attempt at UCT and I'm curious
what tricks exist for tweaking performance.
My rule for promoting a leaf to an interior node is that I must first have
100 sims of that node, but changing
Persson [EMAIL PROTECTED] wrote:
Quoting Jason House [EMAIL PROTECTED]:
2. First play urgency - Giving an artificial upper confidence bounds to
untried moves (I've seen references that 110% win rate is the right
setting)
Where did you see that?
--
Magnus Persson
Berlin, Germany
On 10/26/07, Olivier Teytaud [EMAIL PROTECTED] wrote:
MoGo is very different now.
There's no UCT anymore in MoGo
It's almost mean to tell us that MoGo isn't using UCT and omit further
detail ;)
Would it be safe to assume that it's UCB1-Tuned with the modifications
discussed in the ICML
After much effort, I think I understand most of the GellyShriver
paper[1]. I'm hoping this post will help others and possibly have
people correct any errors I've made.
First, some basic definitions of notation:
* In general, Q is an estimated winning rate, used in three ways:
1. As an estimated
On 10/25/07, David Fotland [EMAIL PROTECTED] wrote:
I just tried it, but I can't connect.
That's expected. Past discussion seems to imply there's some kind of
firewall (or similar) blocking external access.
___
computer-go mailing list
Free but closed source.
There is a linux version, see
http://www.lri.fr/~gelly/MoGo_Download.htm
On 10/25/07, Joshua Shriver [EMAIL PROTECTED] wrote:
Is MoGo a commercial or free program? Open or closed source? Linux
version available?
Thanks in advance :)
-Josh
An XML alternative [1] to SGF has recently come to my attention. What do
others think of this alternative? Personally, the effect of a tag affecting
the previous tag seems kind of strange to me.
PS: I found out about this from [2], a recently closed GoGui feature request
to write more sane sgf
On 10/22/07, Phil G [EMAIL PROTECTED] wrote:
To start, we just need the leading Go programs to read either encoding
format (so they are backwards compatible). This should be somewhat trivial
since you can tell which format just by looking at the coordinate encoding.
In my go bubble, the list
That's definitely a not finding the standard library issue.
Unfortunately, I'm not enough of a linux expert to fix your issue
without getting more detail.
It's been a while since the last time I had to track down an issue like
that on linux. I'd recommend checking which standard library it
Is the text at http://www.red-bean.com/sgf/sgf4.html#ebnf-def correct?
It seems to me that
GameTree = ( Sequence { GameTree } )
Is rather restrictive and should possibly be
GameTree = ( Sequence { GameTree } [Sequence] )
Without a change like that, doing a local variation requires one of
Have you checked out what Remi Coulom did?
http://remi.coulom.free.fr/Amsterdam2007/
It doesn't claim to be the best in the opening, but does claim to do a
decent job in the opening (and a better job in the middle of the game)
On 10/15/07, Erik S. Steinmetz [EMAIL PROTECTED] wrote:
Greetings
I've tried looking at that 7 page paper, but it seems to be light on
detail. Maybe what's given in the paper is enough to reproduce the results,
but I'd need to learn the basics of SVM's to know for sure.
PS: wikipedia recommends
http://research.microsoft.com/~cburges/papers/SVMTutorial.pdf to
On Sat, 2007-10-13 at 15:45 +0200, Stefan Mertin wrote:
Today nearly every program has efficient scalability with time,
so I have to set a time limit but I don´t want to test things like
time-management!
My purpose ever was to test the playing strength and nothing else.
If a program crashes
Does anyone have a good reference for reading the notation in the
Gelley/Shriver paper Combining online and offline knowledge in UCT?
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
I get:
500 - Internal Server Error
I've wanted something like what you describe for running bots on CGOS and
KGS. When I do see the script, I'll see what I can do about hacking in KGS
support to it.
On 10/10/07, Urban Hafner [EMAIL PROTECTED] wrote:
Hej all,
for those of you that also have
to
fix this (or GAMES-1 to GAMES)
games += 1
File.new(TERM, w) if games = (GAMES-1)
On 10/10/07, Urban Hafner [EMAIL PROTECTED] wrote:
On Oct 10, 2007, at 17:32 , Jason House wrote:
I get:
500 - Internal Server Error
Sorry about that. It should work now (I hope).
I've wanted something
On Mon, 2007-10-08 at 16:04 +0100, Nick Wedd wrote:
Congratulations to MoGoBot1 and to MoGoBot2, the undefeated winners of
both divisions of yesterday's bot tournament on KGS!
My report is at http://www.weddslist.com/kgs/past/31/index.html. It
doesn't say much about the play, more about
On Mon, 2007-10-08 at 21:20 +0100, Nick Wedd wrote:
I have added this to my report:
# In its round 1 game with WeakBot50k, HBotSVN achieved a convincingly
# won position with all the dame filled and 25 seconds left on its
# clock. There was then some disagreement about status, and the
On 10/4/07, Nick Wedd [EMAIL PROTECTED] wrote:
The page http://www.gokgs.com/tournInfo.jsp?id=324 allows me to specify
my time zone as Pacific Standard Time (Los Angeles), and then says
that it is using PDT and that the tournament starts at 01:00. (I find
it odd, and confusing, that the
Is it possible to update http://www.weddslist.com/kgs/names.html with
details about the newer entrants? (kago, pagebot, and scottbot)
PS: The double-entries for HBotSVN, hb05, and HouseBot are still on that
page. The later set of descriptions that combine all HouseBot variants into
one block
On 10/2/07, Phil G [EMAIL PROTECTED] wrote:
Also, is it just me that a good evaluation function early in the game is
difficult to write?
I think it's doable. It's just not trivial. Simple pattern matching should
give a reasonable approximation for corner spats at the start of the game.
SIGNED MESSAGE-
Hash: SHA1
Jason House wrote:
On Sun, 2007-09-30 at 12:41 -0400, Don Dailey wrote:
4. correctness of random move selection strategy.
Pick a random empty position. If illegal or eye-filling, remove from
consideration the list and repeat.
Same basic idea. I start
On Sat, 2007-09-29 at 22:06 -0400, Don Dailey wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
I'm starting to get curious. What are you doing that is causing it to
win 11 out of 11 against genAnchor_1k and yet it's only 113 ELO
stronger?And it's supposedly an identical program?
On Sun, 2007-09-30 at 12:41 -0400, Don Dailey wrote:
4. correctness of random move selection strategy.
Pick a random empty position. If illegal or eye-filling, remove from
consideration the list and repeat.
Same basic idea. I start by taking all filled points and removing them
301 - 400 of 522 matches
Mail list logo
