Lars wrote:
I have some questions concernig this paper of Remi:
http://remi.coulom.free.fr/Amsterdam2007/MMGoPatterns.pdf
1. Which sense make the prior (Section 3.3 in the paper and where is the
application?
I understand it the way that you put 2 more competitions to each pattern
in the
A long time ago I thought of how to organize what to prune The Right Way
(tm). I initially thought about it in the context of computer chess, but I
think it is even more relevant for computer go. Instead of doing global
search where you say a node will be considered a leaf if it is n moves away
Hi Hideki,
The file is used by:
cat file | mogo arguments
Adding quit to the file lets mogo quit the game, but
I want to let mogo wait for the obvious next command like
play b vertex
Normally I use the pipe with a self made server program
that send a new line through the pipe each time
Adding quit does not help?
Edward de Grijs: [EMAIL PROTECTED]:
Hi to all,
Can someone help me with this problem, for which I cannot
find a solution:
I am trying to run MoGo in an automatic way, using the
cygwin toolkit.
The problem in its simplest form is this:
If I use MoGo on the command
Hi all,
this discussion about ratings and playing strength of Go programs
on 19x19 and 9x9 with and without handicap stones etc.
is exactly the field I try to find an approach in my tournaments!
Most classic Go programs were designed only to be as strong
as possible in 19x19 and seamed to be
The problem with this is that below a few ply, the probabilities are
all effectively zero. All you're really doing is enshrining the
prior probabilities used to sort the first few levels.
In cases where the good moves are the obvious ones, you've found them
anyway. In other cases, you prune
The problem with this is that below a few ply, the probabilities are
all effectively zero. All you're really doing is enshrining the
prior probabilities used to sort the first few levels.
In cases where the good moves are the obvious ones, you've found them
anyway. In other cases, you prune
On Dec 5, 2007 9:33 AM, Erik van der Werf [EMAIL PROTECTED] wrote:
Look for Realization Probability Search.
Oh, thanks! I knew it was too natural to be original. Well, I actually
thought about it around 1998, so it might have been new back then.
This is very close to what I was saying:
Hi Edward,
Edward de Grijs: [EMAIL PROTECTED]:
Hi Hideki,
The file is used by:
cat file | mogo arguments
I guess MoGo doesn't check end-of-file of stdin.
Adding quit to the file lets mogo quit the game, but
I want to let mogo wait for the obvious next command like
play b vertex
Then, you
You can find my Ruby Mogo controller here: http://fantius.com/Mogo.rb
I created and used this for MechaGoZilla in the November KGS Computer
Go Tournament.
On Dec 5, 2007 8:53 AM, Edward de Grijs [EMAIL PROTECTED] wrote:
Hi Hideki,
The file is used by:
cat file | mogo arguments
In message [EMAIL PROTECTED], steve uurtamo
[EMAIL PROTECTED] writes
snip
to this end, if anyone wants to organize a 9x9 tournament on
kgs (i'm not sure how this is done) where computer players
are allowed (encouraged) to play, with cgos-like time controls,
I think that only a few people
On Dec 5, 2007 1:35 PM, Don Dailey [EMAIL PROTECTED] wrote:
Yes, I think there is a lot to this.Searching by depth is rather
arbitrary.
I think this basic idea is called realization probabilities and I
thought of doing it with the Bradley Terry model.
It also occurred to me that if a
Nick Wedd wrote:
In message [EMAIL PROTECTED], steve uurtamo
[EMAIL PROTECTED] writes
snip
to this end, if anyone wants to organize a 9x9 tournament on
kgs (i'm not sure how this is done) where computer players
are allowed (encouraged) to play, with cgos-like time controls,
I think
On Tue, 4 Dec 2007, Joshua Shriver wrote:
I've been working hard and hope to have an alpha program on CGOS by
Christmas. Know last time I asked this, one useful reply gave just 4-5
commands that were essential.
I have the full spec, and nothing look terribly hard, but I want to get the
minimal
On Dec 5, 2007 5:01 PM, Álvaro Begué [EMAIL PROTECTED] wrote:
On Dec 5, 2007 9:33 AM, Erik van der Werf [EMAIL PROTECTED] wrote:
Look for Realization Probability Search.
Oh, thanks! I knew it was too natural to be original. Well, I actually
thought about it around 1998, so it might have
On Wed, 5 Dec 2007, Joel Veness wrote:
I have been thinking about making a version of Goanna (~2250 on CGOS)
public, once it plays in a human friendly way.
Thanks,
Christoph
___
computer-go mailing list
computer-go@computer-go.org
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 Dec 5, 2007 11:33 AM, Erik van der Werf [EMAIL PROTECTED] wrote:
On Dec 5, 2007 5:01 PM, Álvaro Begué [EMAIL PROTECTED] wrote:
On Dec 5, 2007 9:33 AM, Erik van der Werf [EMAIL PROTECTED]
wrote:
Look for Realization Probability Search.
Oh, thanks! I knew it was too natural to be
On Dec 5, 2007 9:39 AM, Dave Dyer [EMAIL PROTECTED] wrote:
The problem with this is that below a few ply, the probabilities are
all effectively zero. All you're really doing is enshrining the
prior probabilities used to sort the first few levels.
Why would they be zero? floating-point types
two followups, and i'm sorry for not referencing the
original notes directly:
i) i agree that 9x9 has fewer standard deviations of
skill. there's simply less to be good at (ladders are
tiny, life and death can only be so large, the difference
between influence and territory is skewed, etc.).
The cgos 9x9 Game Archives have been updated will all the November 2007
games. Previously the last few days were missing because they were
extracted before the month had ended.
http://cgos.boardspace.net/index.html
- Don
___
computer-go mailing
What would get YOU to bring your program to the Congress? What would you
like to do once you are there? Cheers, David
Hi,
due to my limited funding: compensate the travelling costs, or
make it possible for me to send the program, so it can run on
a local computer there, or
by remote
I have some questions concernig this paper of Remi:
http://remi.coulom.free.fr/Amsterdam2007/MMGoPatterns.pdf
1. Which sense make the prior (Section 3.3 in the paper and where is the
application?
I understand it the way that you put 2 more competitions to each pattern
in the
Hi to all,
Can someone help me with this problem, for which I cannot
find a solution:
I am trying to run MoGo in an automatic way, using the
cygwin toolkit.
The problem in its simplest form is this:
If I use MoGo on the command line, typing the commands which
are send by stdin (i suppose) it
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
You are almost certainly using incorrect scoring. Mogo is a Monte
Carlo program and doesn't care if it wins by 1 point or 50, so it will
have the behavior you are claiming.
However, it won't lose games that way. If it's passively filling in
it's own territory while you steal a won game from
Hi is last black move A4 really illegal in cgos rules?
Just ensure before start change things. It seemed weird.
White D9 shouls change board situation and white kills two stones before A4
is getting then
one stone back fine? t. harri
W A4
9 WW..W.WWW
8 ...W.W.W.
7 WBW..
6 WBBWBBWWW
5
Hi Edward,
Edward de Grijs: [EMAIL PROTECTED]:
Hi Hideki,
The file is used by:
cat file | mogo arguments
I guess MoGo doesn't check end-of-file of stdin.
Adding quit to the file lets mogo quit the game, but
I want to let mogo wait for the obvious next command like
play b vertex
Then, you
You should be using area scoring only and if you are playing handicap
games then either YOU or MOGO is not counting them the same. Or
perhaps Mogo has a bug in the handicap code.
MoGo uses KGS handicap counting (add 1 point to white for each handicap
stone) if the GTP set_handicap_stones
29 matches
Mail list logo
