From: Jason House <[EMAIL PROTECTED]>
> If this is aimed at clearing up ambiguity, you should state which way the
> handicap was given.
Oops! Now I need to clean off my keyboard!
Mmmm, we already have a hotly-contested estimate that computer programs will
play pros on an even basis in ten yea
If this is aimed at clearing up ambiguity, you should state which way
the handicap was given.
Sent from my iPhone
On Aug 13, 2008, at 2:08 PM, "Chaslot G (MICC)" <[EMAIL PROTECTED]
> wrote:
Dear all,
There were details that were unclear about the victory of MoGo.
Hence I created a website
Dear all,
There were details that were unclear about the victory of MoGo.
Hence I created a website to gather useful information about this game:
http://www.cs.unimaas.nl/g.chaslot/muyungwan-mogo/
Cheers,
Guillaume
Message d'origine
De: [EMAIL PROTECTED] de la part de Sylvai
From: Bob Hearn <[EMAIL PROTECTED]>
>Now, my question. Sorry if this has already been beaten to death here. After
>the match, one of the MoGo programmers mentioned that doubling the computation
>led to a 63% win rate against the baseline version, and that so far this
>scaling seemed to contin
your calculation is for mogo to beat kim, according to kim and the
mogo team's estimates.
i think that a better thing to measure would be for a computer program
to be able to regularly beat amateurs of any rank without handicap.
i.e. to effectively be at the pro level.
for one thing, this is easi
On Sun, 2008-08-10 at 11:37 -0700, Bob Hearn wrote:
> Now, my question. Sorry if this has already been beaten to death here.
> After the match, one of the MoGo programmers mentioned that doubling
> the computation led to a 63% win rate against the baseline version,
> and that so far this scaling se
David Doshay wrote:
As an aside, the pro in question won the US Open, so comments about
him being a weak pro seem inappropriate. I spoke with him a number
of times, and I firmly believe that he took the match as seriously
as any other public exhibition of his skill that involves handicap
On Aug 9, 2008, at 4:16 AM, terry mcintyre wrote:
- Original Message
I still have this theory that when the level of the program is in
the high-dan reaches, it can take proper advantage of an opening
book. Alas, it may be a few years before enough processoring power
is routine
Congrats to the MoGo team for getting system time at SARA for a match.
The architecture of the power5/power6 system (2007 july a power5
system was installed and that has been updated to power6 now),
is based upon having sufficient RAM and high bandwidth to i/o (for
each Gflop a specific amoun
- Original Message
> I still have this theory that when the level of the program is in the
> high-dan reaches, it can take proper advantage of an opening book. Alas, it
> may be a few years before enough processoring power is routinely available to
> test this hypothesis. I know that
Congratulations to Mogo team!
Twenty years from now, in ``a computer go history''
August 7th 2008: First victory of computer against pro with 9 handicap.
By the way, the surge in strength with the 800 processors with respect
to the quadcore (old) MogoBot, seemed relatively low, when comparing to
On 8, Aug 2008, at 7:29 AM, Eric Boesch wrote:
On Fri, Aug 8, 2008 at 8:04 AM, Mark Boon <[EMAIL PROTECTED]>
wrote:
First of all, congratulations to the MoGo team.
Ditto!
Absolutely an amazing achievement!
Where I do differ in opinion from most is the remarks from the pro.
He
played
Thanks for posting the game Eric.
When I look back at it it's obvious to me S1 was much better. After
the likely sequence of R1, T3, T2, T4, S7, Q1, R7 Black still has a
serious weakness at N4.
I also still question W's play in the upper-right. I doubt W S15 was
a good move and think S19
ailto:[EMAIL PROTECTED] On Behalf Of terry mcintyre
Sent: Thursday, August 07, 2008 8:48 PM
To: computer go
Subject: [computer-go] mogo beats pro!
This is from the AGA newsletter:
COMPUTER BEATS PRO AT U.S. GO CONGRESS: In a historic achievement, the MoGo
computer program defeated Myungwan Kim
Dear all,
The machine that was used by MoGo yesterday is the Dutch supercomputer
"Huygens", situated in Amsterdam. Huygens was provided by SARA (www.sara.nl)
and NCF(http://www.nwo.nl/nwohome.nsf/pages/ACPP_4X6R5C_Eng). Huygens was
upgraded on August 1 to 60 Teraflops (Peak), so porting MoGo wi
First of all, congratulations to the MoGo team.
As some have remarked already, the difference in level between the
fast games and the slow games was considerable. I didn't think the
level of the fast games was anything to boast about. And my opinion
is more informed than many other observer
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
At 10:07 PM 8/7/2008, you wrote:
...
Check out the KGS records. If my memory is correct, the userid was
MogoTitan. ...
yes, there are some games there. but not all are viewable. which one
is *the* game?
thanks
---
vice-chair http://ocjug.org/
___
> I still have this theory that when the level of the program is in the
> high-dan reaches, it can take proper advantage of an opening book. Alas, it
> may be a few years before enough processoring power is routinely available to
> test this hypothesis. I know that we duffers can always ruin a p
Chris may be right with his implication that I talk too much these
days, but just to keep things honest, the quote below is not exactly
what I said. I said that others were wondering how much time it will
be before the programs are beating the pros. My thought was that
programs have advance
> ... no book, no joseki,...Mogo generated joseki from whole cloth.
> ...
> seemed to me that, as Mogo was given more time, its opening and
> middlegame play was markedly better.
If it is basically reinventing opening theory from scratch each time
then that makes sense. (Though I suppose there is
Well done, Mogo team !
terry mcintyre wrote:
moves,” like those in the lower right-hand corner, where Moyogo took
Typo :-)
Rémi
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
To answer one other question: we were told that Mogo scales linearly. The
supercomputer has a very high-bandwidth interconnect. The Mogo team was unable
to release more architectural details at this time.
To reiterate on another question, from what the team said, no book, no joseki,
just raw s
ROTECTED]>
- Original Message
From: Darren Cook <[EMAIL PROTECTED]>
To: computer-go
Sent: Thursday, August 7, 2008 9:24:00 PM
Subject: Re: [computer-go] mogo beats pro!
Great news. Well done to the Mogo team.
John, if I can just find 3000 CPUs lying around I might actually win
Great news. Well done to the Mogo team.
John, if I can just find 3000 CPUs lying around I might actually win our
bet ;-).
> I do have to ask -- if 1.7 million playouts per second are required
> and an hour of playing time are required to reach this level, ...
Can Olivier give us more details. A
I enjoyed watching this game. Having trouble with KGS at the moment, or I'd
send a game record.
Having more time makes a very marked improvement in the quality of play, to a
degree which surprised me. The first two games, at 10 and something between 10
and 15 minutes ( Mogo thought it only had
This is from the AGA newsletter:
COMPUTER BEATS PRO AT U.S. GO CONGRESS: In a historic achievement, the MoGo
computer program defeated Myungwan
Kim 8P (l) Thursday afternoon by 1.5 points in a 9-stone game billed as
“Humanity’s Last Stand?” “It played really well,” said Kim, who
estimated MoGo’s
27 matches
Mail list logo
