Hello Michael, Lukasz,
Michael Williams wrote:
Are the games archived? Does the public have access to those archives?
Yes, they are. Everybody (with internet access) can
see and replay the games.
For instance, the games of Lukasz Lew can be found at
I am analyzing an interesting position, shown below. It is rich in
lessons, at least for me, so I figured I would share it.
By the way, I have a simple way to find interesting situations. When
Pebbles loses, it saves the *last* position that it thought it was winning
(i.e., the rating of the
Quoting Brian Sheppard sheppar...@aol.com:
Further analysis convinced me that O is actually winning this game. My
current
engine likes A8 for O until iteration 7000, and then F9 for O, and switches
to the winning move only on iteration 143,000. But it doesn't really see
the win, because the
In Havannah, there are not many bots. And, in the meantime
the programmers have marked their profiles accordingly.
Profiles don't help. On LG you just click register and you are paired.
Can you post a link to computer Havannah forum/thread? I was looking
for it on LG few weeks ago and
Łukasz Lew wrote:
In Havannah, there are not many bots. And, in the meantime
the programmers have marked their profiles accordingly.
Profiles don't help. On LG you just click register and you are paired.
Can you post a link to computer Havannah forum/thread? I was looking
for it on LG few
Hello Lukasz and Urban
Łukasz Lew wrote:
In Havannah, there are not many bots. And, in the meantime
the programmers have marked their profiles accordingly.
Profiles don't help. On LG you just click register and you are paired.
I see your point. When you definitely want to avoid being
Many Faces also plays c9 right away, with about 66% win for O, expecting A8
then A6.
-Original Message-
From: computer-go-boun...@computer-go.org [mailto:computer-go-
boun...@computer-go.org] On Behalf Of Magnus Persson
Sent: Monday, June 22, 2009 7:05 AM
To:
Congratulations to Zen, winner of yesterday's KGS bot tournament with 8
wins from 9 games. My (very short) report is now at
http://www.weddslist.com/kgs/past/48/index.html
Nick
--
Nick Weddn...@maproom.co.uk
___
computer-go mailing list
On May 7, David Silver wrote:
However, if you can wait a few weeks I will be publishing a clearer
(I hope!) explanation of how to combine UCT and RAVE in my PhD thesis.
Did this happen? We're about to try implementing RAVE, so a clear
explanation would be a wonderful thing.
Peter Drake
I looked at the report and would like to give my opinion on why the
programs played as they did in the commented game between Zen and Aya.
In the game white 106 threatens to capture the left side and most
importantly avoid the dangers of a huge semeai. If black does not play
111 the game
I've seen reference in some papers to 1x1 patterns. What does that
even mean? A point is either black, white, or vacant, and it's illegal
to play there unless it's vacant.
Confused,
Peter Drake
http://www.lclark.edu/~drake/
___
computer-go
On Mon, Jun 22, 2009 at 11:33:25AM -0700, Peter Drake wrote:
I've seen reference in some papers to 1x1 patterns. What does that
even mean? A point is either black, white, or vacant, and it's illegal
to play there unless it's vacant.
I haven't seen the papers, so I can only speculate. But I
Probably 1x1 patterns implies that different priorities are assigned
to the absolute position of empty moves. AMAF can be seen this way.
AMAF learns statistics of 1x1 patterns if the move is played in the
playout but ignores all information surrounding the move at the time
it is played.
Ah. I had always thought of patterns as translation-invariant.
Peter Drake
http://www.lclark.edu/~drake/
On Jun 22, 2009, at 11:45 AM, Magnus Persson wrote:
Probably 1x1 patterns implies that different priorities are assigned
to the absolute position of empty moves. AMAF can be seen this
Has anyone tried this algorithm improvement on bigger boards and can give us
a result?
Link to original message:
http://computer-go.org/pipermail/computer-go/2009-April/018159.html
Thanks,
ibd
So maybe I could get 600 more Elo points
with your method. And even more on 19x19.
I noticed
I had never considered using AMAF with larger pattern. That's an interesting idea. Perhaps a 5-vertex cross-shaped pattern or a 3x3 pattern. Has anyone tried
this?
Magnus Persson wrote:
Probably 1x1 patterns implies that different priorities are assigned to
the absolute position of empty
Yes. I think it's a good idea, but the devil is in the details. I've become
pretty disenchanted with trying to use 3x3 or 5x5 patterns. Currently, I have
about 300 1x1 patterns (I call them context codes) that I'm playing around with.
You can also do the same for RAVE without needing any more
On Jun 22, 2009, at 1:18 PM, dhillism...@netscape.net wrote:
Yes. I think it's a good idea, but the devil is in the details. I've
become pretty disenchanted with trying to use 3x3 or 5x5 patterns.
Currently, I have about 300 1x1 patterns (I call them context codes)
that I'm playing around
Why not start with the 5-vertex cross pattern? Going from 1x1 to 3x3 is a huge jump in complexity and debugability. With 5-vertex patterns, you can enumerate
the patterns on paper (there are around 3^4 == 81 of them, ignoring symmetries) to sanity-check the details and see if the general idea
In my case, yes.
That is a correct interpretation for the context codes in my program, which are
equivalent to some of the suggestions for the meaning of 1x1 pattern. (But I
don't call them 1x1 patterns.?I also find that term confusing. I don't
remember seeing it before.)
- Dave Hillis
In message 20090622202905.utvbb8wkgk8cw...@webmail.phmp.se, Magnus
Persson magnus.pers...@phmp.se writes
I looked at the report and would like to give my opinion on why the
programs played as they did in the commented game between Zen and Aya.
In the game white 106 threatens to capture the
Sure, that would be a place to start. I also did some testing with just the
number of pseudo-liberties at the position. That was pretty easy to code up.
And I did have some limited success using 3x3 patterns-just not enough to
justify the nuisance of carrying it along in my code.
There are
What komi did you use? It is nice to have the sgf in addition to the
position.
It is 7.5, and I do not have the SGF. I will try to create SGF for future
posts, to make reproduction easier for all.
Could it be that Pebbles have trouble seeing that the semeai is won
after white C9.
Yes,
CGF Open(old name: CGF Special Meeting) was held at the University of
Electro-Communications, Chofu, Tokyo, Japan in 20-21 June 2009.
9x9 participants were 20 teams.
Result of swiss 11 rounds, nomitan and Aya won. (There was no play-off.)
1st nomitan 10-1
1st Aya 10-1
3rd PerStone 9-2
There is a book (2nd Book of Go, I think) that teaches how to count
liberties in a semeai. Once O plays C9 it has far more than two liberties,
since black has to play approach moves on either side to win the semeai.
For example, black has to play 3 times to fill the liberty at D9, and black
can
I tried using AMAF with 3x3 patterns, but it didn't give any improvement.
David
-Original Message-
From: computer-go-boun...@computer-go.org [mailto:computer-go-
boun...@computer-go.org] On Behalf Of Michael Williams
Sent: Monday, June 22, 2009 12:02 PM
To: computer-go
Subject: Re:
26 matches
Mail list logo
