d and the outcome 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
On Wed, 2007-11-07 at 14:34 -0800, Christoph Birk wrote:
> On Mon, 5 Nov 2007, Jason House wrote:
> > I implemented this yesterday. In doing so, I realized I didn't know the
> > proper way to initialize new leaves in the UCT tree. MoGo papers seem to
> > talk about
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
computer-go@com
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.
>
CGOS is currently down.
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
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
Is there any way to look up fairly recent games on CGOS? All too
frequently, I kick off a bot at night from one location and notice (in
another location) the following afternoon that the bot crashed. I then try
to look at the offending game and can't. Is there any relatively simple way
to overco
The following text is incorrect:
"In the round 8 game between FirstGoBot and break13, this position
appeared, White has just played the marked stone. Now Black played
(stupidly) at a, White captured two stones at b, and Black (break13)
tried to recapture the one marked stone."
There is only one m
On Mon, 2007-11-12 at 15:53 -0600, Nick Apperson wrote:
> You will probably get a few people here recommending "D", but that is
> most definately not well supported and it is slower than C or C++ in
> terms of writing a go program.
D is definitely slower in execution than C/C++, but I do find it
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 ne
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 ou
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
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 li
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 j
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 (
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, estim
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
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
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
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 v
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 pr
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 my
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.
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/
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 page
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
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
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
>
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*,
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)
I suspect you're bypassing the CGOS client. The 30 is the time
remaining in milliseconds (AKA 5 minutes). It's not the ID in the GTP
protocol. Thus, your response is invalid. Just return "= E3" and it
should work fine.
On Tue, 2007-11-27 at 20:40 +0200, Harri Salakoski wrote:
> command
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 h
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"
_
I'm in the process of migrating and upgrading the website on my bot. As
a bot author, what would you want to see on the website?
As far as on-liners go...
HouseBot is a multi-threaded MonteCarlo bot written in D.
If I were to add more detail, I'd want to mention that it supports a
variety of m
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, s
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.
>
>
Leela has been running on CGOS 9x9 and 19x19 servers. I have the
distinct impression that the author will keep details of the bot very
close to the chest. The best description I've seen is something to the
effect of a go bot using latest advances in computer go with custom
research.
On Sun, 20
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
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 i
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
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
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 lis
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 prog
On Dec 5, 2007 3:17 PM, Lars <[EMAIL PROTECTED]> wrote:
> Thank you for your explanations!
> You were right, it was a bug, and now it works really fine.
>
Are you (or Remi) willing to publish any of the following?
1. Source code for extracting ELO ratings for moves
2. Full list of gamma values, i
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 dist-
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 poin
On Dec 6, 2007 7:13 AM, Álvaro Begué <[EMAIL PROTECTED]> wrote:
> 88|0|17.033168
> 88|1|12.263955
>
> and
>
> 164|0|17.388714
> 164|1|25.862695
>
> Are identical except for swapping the roles of white and black
Curiously, the gamma values in your example are way different
17.033168 vs 25.862595
On Dec 6, 2007 10:13 AM, Álvaro Begué <[EMAIL PROTECTED]> wrote:
>
>
> On Dec 6, 2007 10:06 AM, Jason House <[EMAIL PROTECTED]> wrote:
>
> >
> >
> > On Dec 6, 2007 7:13 AM, Álvaro Begué <[EMAIL PROTECTED]> wrote:
> >
> > > 88|0|1
On Dec 6, 2007 4:22 PM, <[EMAIL PROTECTED]> wrote:
>
> My program is riddled with code to try and make use of this. (It's always
> bothered me that UCT relies on the standard deviation of (often) multi-modal
> distributions.) It hasn't made my engine any stronger but it has helped me
> understand
As I understand it, gtp is for one way communication. I've heard of this as
an issue when developers try to provide output for the benefit of players
(or bot developer debugging the bot)
There's typically work-arounds that we use to overcome this.
On kgs, to inform the players, the version comman
What is the proper way to interpret the score and opponent columns?
On Dec 9, 2007 7:30 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
> I just put up the improved hall of fame page.
>
> I'm using the values Rémi suggests and the values look more in line with
> CGOS.
>
> Also, FatMan-1 is fixed at 18
On Dec 10, 2007 5:00 PM, Vlad Dumitrescu <[EMAIL PROTECTED]> wrote:
> Am I confused in my understanding that a weakness of MC evaluation is
> that due to its random play it will miss sequences where there is only
> one winning move at each play? This is the way I am interpreting the
> "nakade prob
On Dec 6, 2007 11:38 AM, Rémi Coulom <[EMAIL PROTECTED]> wrote:
> Jason House wrote:
> >
> > This may serve as a good test of if there is enough data to assign
> > values to the patterns.
>
> I did not mention this in my paper, but you can rather easily estimate
On Dec 12, 2007 2:59 PM, Rémi Coulom <[EMAIL PROTECTED]> wrote:
> > Do you mean a plot of the prediction rate with only the
> > gamma of interest varying?
>
> No the prediction rate, but the probability of the training data. More
> precisely, the logarithm of that probability.
I still don't know
On Dec 12, 2007 3:09 PM, Álvaro Begué <[EMAIL PROTECTED]> wrote:
>
>
> On Dec 12, 2007 3:05 PM, Jason House <[EMAIL PROTECTED]> wrote:
>
> >
> >
> > On Dec 12, 2007 2:59 PM, Rémi Coulom <[EMAIL PROTECTED]> wrote:
> >
> > > > Do you
On Dec 12, 2007 4:27 PM, Álvaro Begué <[EMAIL PROTECTED]> wrote:
> Clearly I'm missing something, because I still don't understand. Let's
> > take a simple example of a move is on the 3rd line and has a gamma value of
> > 1.75. What is the equation or sequence of discrete values that I can
> > t
On Dec 12, 2007 10:19 PM, David Fotland <[EMAIL PROTECTED]> wrote:
> Many Faces' life and death search is best first and probability based,
> but I don't use UCT to select moves. I select the move that has the highest
> probability of changing the value of the root (from success to fail or vice
On Dec 13, 2007 2:03 AM, Harald Korneliussen <[EMAIL PROTECTED]> wrote:
> Wed, 12 Dec 2007 07:14:48 -0800 (PST) terry mcintyre wrote:
>
> >Heading back to the central idea, of tuning the predicted winning
> rates and evaluations: it might be useful to examine lost games, look
> for divergence betw
On Dec 13, 2007 11:39 AM, Gian-Carlo Pascutto <[EMAIL PROTECTED]> wrote:
> Jason House wrote:
>
> > MoGo uses TD to predict win rates.
>
> Really? Where did you get that information?
I can't seem to load http://www.lri.fr/~gelly/MoGo.htm at the moment, but I
found
On Dec 13, 2007 2:17 PM, <[EMAIL PROTECTED]> wrote:
> I'd like to start a more specific discussion about ways to combine
> tactical information with MC-UCT. Here's the scenario.
>
> It's the bot's turn and, prior to starting any playouts, it runs a
> tactical analyzer (for want of a better name) t
On Dec 13, 2007 2:37 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
> I am considering to enforce this basic protocol on the server soon:
>
> Programs of the same "family" will not be paired against each other.
>
I frequently look at the games between my bot version more than I look at
them with
On Dec 13, 2007 3:09 PM, David Fotland <[EMAIL PROTECTED]> wrote:
> Isn't Greenpeep an alpha-beta searcher, not UCT/MC?
I could have sworn I heard it described as UCT/MC with MoGo-like
enhancements.
___
computer-go mailing list
computer-go@computer-go.
On Dec 13, 2007 3:40 PM, terry mcintyre <[EMAIL PROTECTED]> wrote:
> Jason House:
> > Don't forget that local tactical analysis can be reused many moves later
> if the local area has remained unaffected.
> > In a multi-core system, it may become increasingly val
On Dec 13, 2007 3:52 PM, Gian-Carlo Pascutto <[EMAIL PROTECTED]> wrote:
> Jason House wrote:
>
> > The paper introduces RAVE and
> > near the end talks about using heuristics for initial parameter
> > estimation. The heuristic they used was based TD.
>
> Ah,
On Dec 13, 2007 4:01 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
> I don't want to add more mechanisms. You can build your own mechanism
> by making your own password naming convention or bot naming
> convention.For instance you can use the underscore character to
> build separate families of
On Dec 13, 2007 4:40 PM, George Dahl <[EMAIL PROTECTED]> wrote:
> Please excuse me if this question has been answered before, my brief
> look through the archives I have did not find it. How does one
> compute unconditional life and death? Ideally, in an efficient
> manner. In other words, I wa
On Dec 13, 2007 4:51 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
> Do you have a suggestion for a specific mechanism for this?
I was mostly just thinking a file that cgos looks for that includes bot
names and the preferences. The don't play list would need obvious
restrictions like what you've al
On Dec 13, 2007 4:50 PM, David Fotland <[EMAIL PROTECTED]> wrote:
> I think Martin Mueller published an improvement to benson's algorithm
> that is also proved correct.
>
Yes. "Safety under alternating play". It's more generally applicable but I
didn't think it met the needs of the original re
On Dec 13, 2007 5:33 PM, <[EMAIL PROTECTED]> wrote:
>
>
> > -Original Message-----
> > From: Jason House <[EMAIL PROTECTED]>
> > To: computer-go
> > Sent: Thu, 13 Dec 2007 3:20 pm
> > Subject: Re: [computer-go] MC-UCT and tactical information
On Dec 14, 2007 10:55 AM, Nick Wedd <[EMAIL PROTECTED]> wrote:
> I'll bet that if someone ever does write a go-playing program that
> adapts its play in the light of what happens in the games it plays, I'll
> eventually be able to train it to make some _really_ bad moves.
That trick works again
On Dec 14, 2007 12:43 PM, <[EMAIL PROTECTED]> wrote:
> For purposes of discussion, let's say the bot takes a tactical snapshot
> once at the root node and then uses that information to help pick a move. It
> can apply it at the root, at internal nodes, at external nodes, or at the
> very end (mayb
In Remi's paper on ELO ratings of moves, how is mean log evidence computed?
Is that looking at the probability of the training set? e.g. if the
selected moves have estimated probabilities of 1/e, 1/e^2, 1/e, and 1/e,
then the log evidences would be -1,-2,-1, and -1 for a mean log evidence of
-1.25
On Dec 19, 2007 9:27 AM, David Fotland <[EMAIL PROTECTED]> wrote:
> I only use 2 random numbers per point, one for black and one for white.
> I xor another random number indicating the side to move.
>
What about ko? I use another number for points that are illegal due to ko.
I think I define a
On Dec 19, 2007 10:24 AM, Don Dailey <[EMAIL PROTECTED]> wrote:
> Why do you need to initialize the seed more than 1 time?You should
> use zobrist hashing.
By design, my program reinitializes the random seeds. This is done at the
start of each genmove and is intended for repeatability.
___
On Dec 19, 2007 10:44 AM, Don Dailey <[EMAIL PROTECTED]> wrote:
> I actually have a routine in Lazarus that rotates a full board. It's
> called transformBoard() and it takes 2 arguments - a board to rotate and
> a transformation (0 through 7) and returns a new rotated board.
>
> I don't use it
On Dec 19, 2007 11:49 AM, Don Dailey <[EMAIL PROTECTED]> wrote:
> It's also possible to select hash keys such that transformations of the
> board's key is the same as recomputing the key for a symmetrical board
> position. This will be *much* faster. I came up with a scheme to do this
> and doc
On Dec 19, 2007 12:25 PM, Chris Fant <[EMAIL PROTECTED]> wrote:
> > The basic idea is this: 90 degree rotation (to the right) is represented
> as
> > a circular shift (to the right) by 1/4 of the key length. mirroring the
> > board (swap left and right) is done as reversing the order of the bits
On Dec 20, 2007 10:15 AM, Arthur Cater <[EMAIL PROTECTED]> wrote:
> With 8 hashes per position, the chance of two different boards
> producing a different set of hashes but
> the same canonical hash is greater than 1/2^64, because there will be
> a bias in the choice of canonical
> hashes - toward
On Dec 5, 2007 4:44 AM, Lars <[EMAIL PROTECTED]> wrote:
> I have some questions concernig this paper of Remi:
> http://remi.coulom.free.fr/Amsterdam2007/MMGoPatterns.pdf
>
> @Remi: How many iterations you had used?
>
> Anyone of you have similar or other experiences with the algorithm?
I seem t
On Dec 20, 2007 11:43 AM, Jason House <[EMAIL PROTECTED]> wrote:
> I seem to have more time to think than to code lately. I believe I've
> derived an alternate update method.
>
Thinking more, I realize I messed up a three things...
For one, Newton-Raphson requires
new gam
On Dec 20, 2007 5:39 PM, Álvaro Begué <[EMAIL PROTECTED]> wrote:
> I was trying to come up with my own algorithm to maximize likelihood and I
> am having a hard time getting it all in my mind. I managed to write a
> working algorithm for the case of logistic regression, but it was kind of
> brittl
On Dec 21, 2007 8:53 AM, Rémi Coulom <[EMAIL PROTECTED]> wrote:
> Hi,
>
> Minorization-maximization is a simple optimization method, and I agree
> that it is likely that more efficient algorithms can be applied.
>
> Newton's method implies estimating the inverse of the Hessian matrix.
> Really com
On Dec 21, 2007 10:03 AM, Álvaro Begué <[EMAIL PROTECTED]> wrote:
> I am sure MM is a perfectly good algorithm for this purpose, but it has
> the serious down side that I don't understand it. :) I do understand the
> general idea behind it and how it works in some simple cases, but I don't
> know
t jump in performance.
On Dec 21, 2007 2:07 PM, Rémi Coulom <[EMAIL PROTECTED]> wrote:
> Jason House wrote:
> > For each iteration of batch updates, do you pass over the data
> > computing whatever you can and then pick a set of mutually exclusive
> > items to update
I think of Bradley Terry as a generic class of mathematical models.
I have to assume you mean what Remi did in Crazy Stone.
http://remi.coulom.free.fr/Amsterdam2007/MMGoPatterns.pdf
If that's not what you're looking for, can you post more clarification?
I've started an open source implementation
If your bot has enough points to win under Tromp Taylor scoring, why
capture dead stones? Passing is the fastest way to end the game in your
favor. That trick should limit your game length to something manageable.
I've been thinking that I should add that feature to my bot.
I've also considered
On Jan 2, 2008 10:27 AM, Erik van der Werf <[EMAIL PROTECTED]> wrote:
> I'd propose something simpler:
>
> No time is deducted for pass.
That may be a bit too lax. A bot that thinks for 5 seconds before passing
could delay all bots on the server. I'd favor something in the same spirit
that lim
On Jan 2, 2008 3:29 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
> I am considering to implement Fischer time on CGOS, but I would like it
> to be painless. I don't believe GTP has a provision to handle it -
> but I will check to see what it does have. (I have no intentions of
> doing the byo-
On Jan 3, 2008 10:21 AM, Don Dailey <[EMAIL PROTECTED]> wrote:
>
>
> Robert Jasiek wrote:
> > Don Dailey wrote:
> > > you can never solve the problem of a
> >> malicious opponent who wants to prolong the game needlessly.
> >
> > I solved that many years ago: Constant game end rule.
> > http://home
On Jan 4, 2008 4:44 PM, Gian-Carlo Pascutto <[EMAIL PROTECTED]> wrote:
> steve uurtamo wrote:
> >> It was my understanding that the netlag to the Philippines was about
> >> 380 ms; accounting for an additiaonal 15% packet loss and we end up
> >> at about 440 ms.
> >
> > i think that it works out t
Thanks for the write up.
To add to the list of misbehaving bots, in round 4, HBotSVN passed 41 times
out of 81 white moves. Probably not surprising, but the 81st white move
(move 162) was "resign"
Additionally, one nit pick: The text with the diagrams lists bot a vs. bot b
and then discuss black
On Jan 8, 2008 7:42 AM, Don Dailey <[EMAIL PROTECTED]> wrote:
> None of the KGS specific extensions are required or used. undo is not
> necessary.
I know that CGOS will use kgs-time_settings if it's available.
___
computer-go mailing list
computer-go
I haven't been using CGOS at all lately (planned gap in development around
the holidays). When I do start up again, it'll probably be on the 9x9
server. I'd do this because of the following reasons:
* Games finish faster on the 9x9 server
* Current testing/tuning is done on 9x9
(I have a short
I don't have a copy of the code, but the bias of any given node should be
the sum of the bias of all of its children.
On Jan 9, 2008 1:49 PM, <[EMAIL PROTECTED]> wrote:
> I'm looking at the code of Libgo110. I have a question. In the file
> uct.cpp and the definition of class note_t, the explore_
501 - 600 of 660 matches
Mail list logo
