On 9/18/07, Jason House <[EMAIL PROTECTED]> wrote:
>
> Don't play in that spot if the "4" neighbors match your color
>
To avoid the questions about corners and edges, the reason the four is in
quotes is because it's usually 4, but can be 3 on the edge and 2 in
Since I've started thinking about adding 3x3 patterns in my own code, has
anything ever evolved from this? For example, I'd be interested in
contrasting the frequency of playing a pattern with the frequency that the
opportunity to play the pattern pops up.
On 5/26/07, Peter Drake <[EMAIL PROTECTED
[EMAIL PROTECTED] wrote:
I have a set of 3x3 patterns trained on a subset of the ~20K games in
the NNGS file that's floating about. I use them in my heavy MC
playouts and also for move prioritization in progressive widening. I
think they are very useful, up to a point.
- Dave Hillis
Are you
Christoph Birk wrote:
// Loop to do #1 above
while (p != singletonSimplePass){
if (numMoves < keepMax)
moves[numMoves] = p;
workingCopy.play(c,p);
c = c.enemyColor();
Christoph Birk wrote:
On Wed, 19 Sep 2007, Jason House wrote:
My logic behind stopping at the first pass is that it's highly
unlikely to form life in the void from captured stones. Since
capturing the stones would increase the length of the game and isn't
very likely to change the
ivan dubois wrote:
Hello to all.
I have put my program on cgos, but i never receive the "time_left" command. Is
it normal, or am i doing something wrong ?
When I first put my bot up on cgos, I hit a similar issue, even though I
listed time_left in known_commands. They key for me was to a
ED]>
> To: computer-go
> Sent: Tue, 18 Sep 2007 3:33 pm
> Subject: Re: [Housebot-developers] [computer-go] ReadyFreddy on CGOS
>
> By the data in your upper table, the results need to uphold their mean
> for 40 times as many trials before you even get a significant*
&
On 9/21/07, Don Dailey <[EMAIL PROTECTED]> wrote:
>
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> Jason,
>
> I noticed from several emails that you are probably doing a lot of
> little things differently and assuming they make no difference.
This thread has certainly helped highlight the
On 9/21/07, Christoph Birk <[EMAIL PROTECTED]> wrote:
>
> It might be hard to compare your AMAF-bots with Don's since he
> uses quite some tricks to improve their performance. I suggest
> you compare with some plain-vanilla program I keep for comparison
> on CGOS
>
> myCtest-10k (ELO ~1050)
> m
I'd only be interested in 19x19 games with enough time for reasonable
games. I'm ok with slow games. My biggest problem is that my bots are
simply too immature for 19x19.
On 9/21/07, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
>
> If the 19x19 CGOS is going to be retired due to lack of interest
9x9 has been down all afternoon. I don't know about 19x19.
On Sun, 2007-09-23 at 15:57 -0400, Joshua Shriver wrote:
> Can anyone connect to the CGOS server? Trying to run Dog on the 19x19
> and it wont connect.
>
> -Josh
> ___
> computer-go mailing lis
I just looked at 133684. ego110_allfirst took all the way until move 18 to
play a move above the 2nd line. In fact, in the 8 moves it made prior to
that, 5 were on the first line. ErlyGo's random plays had only 2 on the 2st
line and 2 on the 2nd line. It seems like a random strategy gives a bet
For the game we both looked at, 133684, the end position had 33 solid points
(stones+territory) for ego and 45 solid points for erlygo. 3 were
undecided. If ego got all 3, it'd have 36. With komi, that'd be 7.5higher, or
43.5. The best ego could do is lose by 1.5 points, so resigning is the
cor
On 9/24/07, Don Dailey <[EMAIL PROTECTED]> wrote:
>
> > I've been toying around with time control lately (and failing to get it
> > right).
>
> The main principle in time control is that early moves are far more
> important than later moves.When 2 equal fairly weak bots play, the
> game is usua
On 9/24/07, Don Dailey <[EMAIL PROTECTED]> wrote:
>
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> > I had a very kiss algorithm previously. It was very close to
> > time_to_use = 0.1 * (time_left - 60)
>
> My impression is that you over-engineer (or over-think) everything. You
> try to im
I see that myCtest has an AMAF version up on CGOS. Is it possible to share
details of what was done (under the hood) to get it up and running? I'm
curious if Don's strategy was followed and how the different pieces
implemented compare to the various features discussed in the thread about
ReadyFre
I've kicked off another all moves as first variant. I think it matches all
recommendations on how to improve the all moves as first performance, but
still appears to be quite weak.
http://cgos.boardspace.net/9x9/cross/hb-amaf2.html
Here's all the variants that have now run on CGOS. Descriptions
author(s) have not
joined into the discussions
ego_allfirst2 (> 1400 ELO)
libEGO_AMAF
libEGO_AMAF2 (> 1400 ELO)
ego110_allfirst (very weak - < 500 ELO)
s.
>
>
> - Original Message
> From: Jason House <[EMAIL PROTECTED]>
> To: computer-go
> Sent: Thursda
On 9/24/07, Don Dailey <[EMAIL PROTECTED]> wrote:
> My impression is that you over-engineer (or over-think) everything. You
> try to improve on something before you've implemented something that is
> simple and you know works reasonably well.
>
My latest timing implementation is available under
I'll put up a 1k version with 7/8 tonight.
PS: The newer timing code is not in the experimental amaf branch of bots.
All I've changed from the original amaf is what I've indicated in the
ReadyFreddy thread.
On 9/27/07, Don Dailey <[EMAIL PROTECTED]> wrote:
>
> -BEGIN PGP SIGNED MESSAGE-
>
On 9/27/07, Don Dailey <[EMAIL PROTECTED]> wrote:
> You should experiment a little to get the best settings but this
> depends somewhat on the level. For 1000 sims 7/8 is probably
> better than the 5/8 I told you previously, which was apparently
> the wrong number or I have the wrong source code
On 9/28/07, Christoph Birk <[EMAIL PROTECTED]> wrote:
>
>
> On Sep 28, 2007, at 4:28 AM, Jason House wrote:
> > On 9/28/07, Jason House <[EMAIL PROTECTED]> wrote:
> > Since there's obviously some kind of major performance gap, for now
> > I'll aim t
On 9/28/07, Jason House <[EMAIL PROTECTED]> wrote:
> Since there's obviously some kind of major performance gap, for now I'll
> aim to align with Anchor_1k. From there, I hope it'll be easier to diagnose
> what's going wrong.
>
C
On Fri, 2007-09-28 at 18:43 -0400, Don Dailey wrote:
> Somewhere in your program I am sure there is a head-slapping error you
> will find and when you do you will scream out loud! Don't give up.
Yup... A nice little omission of casting.
int nwins, nsims;
...
double winRate = nwins/nsims;
...
w
On Sat, 2007-09-29 at 03:45 -0700, steve uurtamo wrote:
> I'm glad that you found it. seems like winRate
> would end up as 0 most of the time and thus
> you'd make nearly random moves?
Yes, winRate would be 0.0 (unless every random simulation with that
point was a victory such as in late endgame)
gt; the specific line of code without having ever seen the code! (Of
> course it was a wild stab in the dark.)
>
> - - Don
>
>
> Jason House wrote:
> > On Fri, 2007-09-28 at 18:43 -0400, Don Dailey wrote:
> >> Somewhere in your program I am sure there is a head-slap
Statistically speaking, I can say with 99.9% confidence that
hb-amaf-1k-v2 is stronger than genAnchor-1k. No need to wait any longer
to conclude that :) The math to compute the one-tailed p-value for
rejecting the null hypothesis that the bots are the same strength is
left as an exercise for the
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 progra
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 removin
wrote:
>
> -BEGIN PGP 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 ill
On 10/1/07, Don Dailey <[EMAIL PROTECTED]> wrote:
>
> Why use any of those highly inferior languages you mentioned when you
> could do it Lua, the best language ever invented and highly superior (in
> every possible way) to all else?
Don't you know, all programs should be written in Intercal? T
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
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 shou
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
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 abo
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
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
ng two lines 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
>
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/
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 cras
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
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:
>
> Greeting
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 le
I'm glad you posted about that. I was thinking of it but couldn't remember
the name of it.
It looks like there may have been some data loss in the past (discussed in
blogs). I see several links that are broken. I found the text at
http://www.moyogo.com/files/%7BAF6C0FD3-B2EF-4CBE-85CB-7359B82A4
Those are some interesting links. Does anyone know the prediction rates
of kombilo?
On Wed, 2007-10-17 at 22:13 +0200, Rémi Coulom wrote:
> Erik S. Steinmetz wrote:
> > I would like to thank everyone who responded on this thread. The
> > pointers have been very helpful.
> >
> > I would also lik
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 that value to 10 seems to give very
significant performance improvements
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 should
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 f
On 10/22/07, Don Dailey <[EMAIL PROTECTED]> wrote:
>
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> I personally hate XML. It's crazy to reject SGF because of it's
> readability only to use XML which is verbose and only somewhat readable
> if you carefully construct it to be.What is cr
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, th
On 10/23/07, Jeff Nowakowski <[EMAIL PROTECTED]> wrote:
>
> On Tue, 2007-10-23 at 01:16 -0700, Phil G wrote:
> > As a community, I believe we can improve SGF by extending the
> > specification slightly to allow points to also be encoded in
> > "standard" coordinates and depreciated, admittedly slow
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
computer-
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
> __
On 10/25/07, David Fotland <[EMAIL PROTECTED]> wrote:
> I think Anders supports using Korshelt notation in sgf (E4, etc, with no
> I).
>
Who or what is Anders?
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/
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, Chr
ate 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 mus
07, Magnus 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)
>
>
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 p
After much effort, I think I understand most of the Gelly&Shriver
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 estimat
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 re
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?
>
> Yo
Of course, 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
> >
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 r
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 the
t; wrote:
>
> On Oct 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
> &
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 myCte
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
> pl
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
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 av
On 10/30/07, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
>
>
> > -Original Message-----
> > From: Jason House <[EMAIL PROTECTED]>
> > To: computer-go
> > Sent: Mon, 29 Oct 2007 3:00 pm
> > Subject: Re: [computer-go] BOINC
>
>
>
>
On 10/30/07, Heikki Levanto <[EMAIL PROTECTED]> wrote:
> This works surprisingly well, although there are some drawbacks.
> Evaluating
> positions this way prefers safe, solid groups. And in the end game, when
> the
> result is decided, the programs play unnatural moves, since all moves lead
> to
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
On 10/30/07, Heikki Levanto <[EMAIL PROTECTED]> wrote:
> Of course this does not apply if one has confidence in having the game
> perfectly well analysed, and will know how the game will end. Such
> finesse
> is seldomly seen in kyu-level human players. And computer programs are not
> quite that
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 an
I think I've found a bug in your bot(s). It seems to resign at
inappropriate times. In both cases, your bot was playing as white and mine
as black.
myCtest-V-0008 resigned incorrectly in
http://cgos.boardspace.net/9x9/SGF/2007/11/01/179849.sgf
(I think optimal endgame is J5 leading to a 36 to 52
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
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 e
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
http://www.computer-go.org/mailman/listinf
pop up all the specified games.
>
> - Don
>
>
>
>
> 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 th
u downloaded?)
>
>
>
> - Don
>
>
>
>
>
> 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,
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 update
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
mber 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
> >
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
share?
On 10/29/07, Christoph Birk <[EMAIL PROTECTED]> wrote:
>
> On Oct 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
On Fri, 2007-11-02 at 22:28 +0100, Benjamin Teuber wrote:
> I don't think there's something different at different depths in the
> tree..
> To update RAVE after a simulation, for each child of a node you
> visited during that simulation, you update if the move leading to the
> child was played la
On Sun, 2007-11-04 at 11:26 +, Jacques Basaldúa wrote:
> Solved!
>
> It is working now. The problem was the tcl script does not
> pass all remaining parameters to the called application
> (gnugo in the example). To solve this, the command line
> should be delimited with a quote " char.
This
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 bringi
On Nov 3, 2007 5:25 PM, Benjamin Teuber <[EMAIL PROTECTED]> wrote:
> On 11/3/07, Jason House <[EMAIL PROTECTED]> wrote:
>
> >
> >
> > On Fri, 2007-11-02 at 22:28 +0100, Benjamin Teuber wrote:
> > > I don't think there's something different
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 a dream.. ;)
It's not a bad dream. That kind of thing could help spur development of
good ways to handle Japanese scoring. I fear that programs which are weak
would
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
Personally, I'm ignorant on the subtle nature of Japanese rules. I look it
as territory scoring instead of area scoring. Area scoring has the nice
side effect that people can and should stop playing a game once all
territory is decided.
Having run a "dumb" bot on KGS in the past, I became sensit
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 of
I think how 5x5 was solved was part of a thesis. I don't have the URL or
author handy.
7x7 is semi-solved by a bunch of dans, but no formal proof of its
correctness is available.
I believe that past work used brute force alpha-beta with transposition
tables. 5x5 was made tractable by detecting
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 PROTE
401 - 500 of 660 matches
Mail list logo
