2008/8/8 Ray Tayek <[EMAIL PROTECTED]>:
> yes, there are some games there. but not all are viewable. which one is
> *the* game?
http://files.gokgs.com/games/2008/8/7/MyungWan-MoGoTiTan-4.sgf
--
Seo Sanghyeon
___
computer-go mailing list
computer-go@com
2008/7/12 Jason House <[EMAIL PROTECTED]>:
> I tracked down a rare hang/crash in my bot and I'm curious how others handle
> this.
>
> I use simple ko state as part of my hash lookup, but I don't use super ko. I
> can't store the whole graph history because then there would be no
> transpositions at
2007/12/12, Raymond Wold <[EMAIL PROTECTED]>:
> Are you saying that there is absolutely no way to combine such with an
> MC program to make it better? Not just that no one has done it (I don't
> know if anyone has) but that it is impossible? Are you saying that
> attempts to do so are wasted? If yo
2007/12/2, Joshua Shriver <[EMAIL PROTECTED]>:
> There was a thread on CCC (computer chess) about Go. An interesting post was
> made that linked to Leela, a Go engine and GUI written by the author of Deep
> Sjeng which is a moderate to high level chess engine.
>
> http://www.sjeng.org/leela.html
>
2007/11/23, Jim O'Flaherty, Jr. <[EMAIL PROTECTED]>:
> Don,
>
> I think it is tenuous to predict, much less emphatically assert, that
> just because the evidence is linear at the lower scale, it remains so at
> higher scales. While it is reasonable to assume, it is not certain. I
> see your point
Some more information:
Date: 2007-11-28 and 2007-11-29
Place: Hanguk Kiwon
Players:
An Joyeong 9p
Song Taegon 8p
Weon Seongjin 8p
Han Sanghun 1p
Rui Naiwei 9p
Jiang Zhujiu 9p
--
Seo Sanghyeon
___
computer-go mailing list
computer-go@computer-go.org
ht
http://senseis.xmp.net/?EnvironmentalGo
Korean newspapers reported that Berlekamp will hold a league of
environmental go games between six top Korean professional players,
and analyse the result. I think this will give us a better sense of
the gap between the perfect play and the current top human
2007/10/29, Ben Lambrechts <[EMAIL PROTECTED]>:
> Has anyone tried to program Go via BOINC?
Like, trying to solve 7x7 by distributed computing? That would be
interesting. (Although I'm skeptical about participation.)
--
Seo Sanghyeon
___
computer-go ma
2007/10/28, Joshua Shriver <[EMAIL PROTECTED]>:
> Anyone recommend a free SGF viewer for Linux? I'd really like to find
> something like SCID but for Go.
I use qGo and Kombilo.
--
Seo Sanghyeon
___
computer-go mailing list
computer-go@computer-go.org
2007/7/20, Joshua Shriver <[EMAIL PROTECTED]>:
What kind of data structures do you all use for your engines, in
respect to board representation and move generation. I know in chess
bitboard, mailbox board[8][8], 0x88 exist all with their pro's and
cons. Are there similar concepts for Go?
Below
2007/6/20, Don Dailey <[EMAIL PROTECTED]>:
3. Fischer - Best. If you are really short on time, you can gain
time on your clock by playing easy moves more quickly.
I also note that this would allow trading ko threats with time. In
typical Go positions there are many forcing moves available.
-
2007/6/19, steve uurtamo <[EMAIL PROTECTED]>:
Don, I like you very much, but when you say that byo-yomi
is unfriendly to humans, I have to say that you clearly haven't
played enough go. Byo-yomi is incredibly friendly to humans.
If you don't like it, try canadian timing, which is also very
frie
2007/6/16, steve uurtamo <[EMAIL PROTECTED]>:
on the other hand, there are places and times where
a little assembly can go a very, very long way. i seem
to recall (although i'm probably misremembering this)
that if you need to copy more than a page worth of data
on a pentium, directly using asse
2007/6/15, Magnus Persson <[EMAIL PROTECTED]>:
If this line is correct then it was Steenvreeter that played a bad move at 51,
but Mogo failed to take advantage of this subtle mistake and lost with
move 52.
Now of course this line is not correct either because after 50
black A6 H4! H5 J3 F9 B8! E
2007/6/14, Sanghyeon Seo <[EMAIL PROTECTED]>:
The game:
http://www.grappa.univ-lille3.fr/icga/round.php?tournament=169&round=9&id=2
I started a page at Sensei's Library for other's appreciations and comments:
http://senseis.xmp.net/?MoGoVsSteenvreter
Please
2007/6/14, Sylvain Gelly <[EMAIL PROTECTED]>:
Thank you for your analysis. Did you looked at the first game
Steenvreeter-MoGo (MoGo was white)?
I wonder, because MoGo was really happy, estimation always increased, up to
81%, then in one move dropped to less 50%, and MoGo eventually lost. I
wonder
2007/6/14, Magnus Persson <[EMAIL PROTECTED]>:
Quoting Sylvain Gelly <[EMAIL PROTECTED]>:
> Hi Darren,
>
> After white (mogo) H2, MoGo was estimating 74%, and expecting:
> H2 G1 H3 B1 A1 B3 H1 F8 B5 H4
> Then black played H3, and estimation increased to 81%, white B3 and
> expecting:
> B3 B1 A1
2007/6/14, Darren Cook <[EMAIL PROTECTED]>:
Beyond that, the only thing I've concluded so far (this *is* a complex
position) is that white H2 was the only choice at that point. White
seems to die quickly in the alternative moves I looked at (G1, H3, B3),
and the white chain in the middle is too b
2007/6/14, Sylvain Gelly <[EMAIL PROTECTED]>:
Hello Sanghyeon, thank you for your comments.
> > After white (mogo) H2, MoGo was estimating 74%, and expecting:
> > H2 G1 H3 B1 A1 B3 H1 F8 B5 H4
> This is far too optimistic. Why would black play H2? :-)
Sorry, white played H2. The sequence I gave
The game:
http://www.grappa.univ-lille3.fr/icga/round.php?tournament=169&round=9&id=2
Sylvain posted some anaylsis from MoGo side. Following are my comments
(KGS 4k) as I understand the situation:
After white (mogo) H2, MoGo was estimating 74%, and expecting:
H2 G1 H3 B1 A1 B3 H1 F8 B5 H4
Thi
2007/6/14, Sylvain Gelly <[EMAIL PROTECTED]>:
After white (mogo) H2, MoGo was estimating 74%, and expecting:
H2 G1 H3 B1 A1 B3 H1 F8 B5 H4
Then black played H3, and estimation increased to 81%, white B3 and expecting:
B3 B1 A1 B4 C5 C4 A3 C6 B6 B5
Actually during pondering MoGo realized that it
2007/5/27, Peter Drake <[EMAIL PROTECTED]>:
3197 occurrences of
...
w?.
BB.
(7 transformations. Another full triangle.)
This is called "Turn".
http://senseis.xmp.net/?Turn
This is a standard Go term, originating from qu3(Chinese),
magari(Japanese), guburim(Korean).
--
Seo Sanghyeon
_
>MINIGO ICHIBAN SHOUBU would be a reading of Japanese .
>(Translation would be "Mini go sudden death".)
Are you kidding? "ICHIBAN SHOUBU" means one game match.
Eh, doesn't "sudden death" mean "one game match" in English?
And I know how to read Japanese, thank you.
--
Seo Sanghyeon
_
> >The best source of 9x9 professional games is the Mini-go TV series,
> >which finished a few years back, but should have close to 700 games if
> >you can track down the complete set.
> Where would one begin to track down this show?
http://home.wwgo.jp/minigo/
MINIGO ICHIBAN SHOUBU would be a r
2007/4/12, Don Dailey <[EMAIL PROTECTED]>:
9x9 is a good board size for computers. I'm not really sure if there
is anything special about 19x19 (why not 17x17 or 21x21?) perhaps
they thought 17x17 was too hard (if it's true that smaller boards
are harder for humans.)
To the question "why not
2007/4/10, Chrilly <[EMAIL PROTECTED]>:
a) If one setups a position. Is there a property for the number of white and
black captured stones so far.
I don't think so. Though KM can be used to adjust the score.
b) There is the property AE. The list of empty points. Is it necessary to
setup also
Thanks to Brett Koonce for discovering the games. They are here:
http://www.gokgs.com/gameArchives.jsp?user=pwaldron&y=2007&m=3
http://files.gokgs.com/games/2007/3/20/pwaldron-2.sgf is Philip
Waldron reviewing one of his games, and has these comments:
pwaldron [-]: this is part of a exhibition m
2007/3/26, Jason House <[EMAIL PROTECTED]>:
There are some freely available regression test suites. Two come to mind:
* computer go test collection 2.0
* The regression suite available in gnu go
There's also STS-RV, a comprehensive test suite for capturing races.
STS-RV stands for "Semeai Tes
2007/2/6, Nick Wedd <[EMAIL PROTECTED]>:
I am pleased to find that people read my reports so carefully, and that
they report my errors to me. I have now, I hope, removed all these
errors, and uploaded the corrected version. I am particularly grateful
for the analysis supplied by Sanghye
2007/2/6, Sanghyeon Seo <[EMAIL PROTECTED]>:
If black plays K3-N3-L7 to protect this weakness, N1-M2-K2 makes an
eye at the bottom.
Well, K3-N3-K2-N1 is another line and now white M1 and L7 are miai.
This appeared as "cached" in GNU Go's trace because it's really
2007/2/6, Nick Wedd <[EMAIL PROTECTED]>:
I have put a short report on the event at
http://www.weddslist.com/kgs/past/23/index.html
"In round 3, GNU, playing against MoGoBot13, played the marked move in
the diagram. This is a blunder – it can only live its group by making
a second eye at L7 (it
2007/1/22, Darren Cook <[EMAIL PROTECTED]>:
A couple of related comments. First, in the 2-day games the pros spend
almost all their thinking time in the opening, i.e. considering
different joseki and how they work together. By the time they get into
the endgame they are playing almost all moves
2007/1/3, Chrilly <[EMAIL PROTECTED]>:
As I told before I organized with Nimzo a jackpot bltiz system. When the
jackpot reached 500 ATS (50 $) there was a queue of GMs who wanted to play.
This was during the tournament and they had their own games running. They
did not care about their own games
2006/12/26, Don Dailey <[EMAIL PROTECTED]>:
There are many other ways to take advantage of your opponent in
chess that I consider sound if applied in a very measured and
careful way. None of them call for making truly unsound moves,
especially when you consider that in a losing position, all mo
Recently Remi Coulom asked for Go positions that are easy to
understand for humans, and difficult for computers.
I missed the thread at the time, so here's my late two cents.
GNU Go passes as black. White plays C1. Now A1 and E1 are miai. White
wins 1 point. (There are same number of black and w
2006/10/5, Richard J. Lorentz <[EMAIL PROTECTED]>:
What seems to happen is that twogtp
sends a quit command at the end of the game and I can't seem to find the
right response to this command. If I do nothing the program hangs. If I
terminate the program twogtp complains that my program died. Othe
36 matches
Mail list logo
