From: Don Dailey dailey@gmail.com
My basic observation is that over the several year period I have been in this
forum, I have detected a huge amount of resistance to the idea that hardware
could have anything to do with computer go strength, despite
Terry,
I don't think the part of the argument looking at hardware is sound. You
are assuming that computing power is going to continue to provide a
linear strength increase with every doubling. I think the argument being
made by a few of the previous posters is that the strength curve is
Hardware has a huge effect on go strength, but mainly by enabling better
algorithms. MCTS would have been impossible on the 640 KB, 24 MHz, 80286 I
used to develop Many Faces of go.
I think you would agree with me when I say that the stronger programs five
years from now will gain that
In my humble opinion, we need a change in the algorithm. The numbers are
misleading - 95% of win of
MoGo on 32 nodes against MoGo on 1 node (this is a real number for 19x19)
certainly means that the
parallel version is stronger than the sequential version, but not much
better, far less than what
On Wednesday 10 June 2009 22:15:22 Ian Osgood wrote:
We have evidence against going this low: Rybka and several other
modern engines were ported to the dedicated computers Resurrection
(203 MHz StrongArm) and Revelation (500 MHz XScale). Rybka's rating
in the SSDF pool on these platforms
On Wednesday 10 June 2009 18:48:55 Martin Mueller wrote:
Currently, we try to sidestep this fundamental problem by replacing
local search with local knowledge, such as patterns. But that does not
fully use the power of search.
So, has anyone tried recursive UCT (using UCT again in the
Auch,
Japanese computer Go developers will have CGF Open computer
Go tournament on June 20th and 21st.
#CGF stands for Computer Go Forum (Japan).
#http://www.computer-go.jp/index.html
Announcement:
http://hp.vector.co.jp/authors/VA012620/cgf2009/cgf2009.html (in
Japanese)
Entrants:
Another 2 cents from me:
what about inviting good old Bruce Wilcox for
a show event against computer(s)?
With him you would get all in one:
* strong amateur
* author of (old) go program
* author of one of the best go books ever
Ingo.
--
GRATIS für alle GMX-Mitglieder: Die maxdome Movie-FLAT!
Would this be a simple way of using many cores effectively?
Otherwise I cannot see how recursive UCT would be anything else than
an ineffective implementation of UCT. Unless it provides some
information that could be used more effectively than with normal search.
In order to do so the
I very strongly suspsect that Many Faces, Mogo, Crazy Stone and others are
heavily optimized to play well on exactly the hardware we have at the
moment.
There is the huge problem that you cannot easily test scalability because
you cannot produce the thousands of game needed to get accurate
I know what Moore actually said and what is perceived as Moore's law are two
different things. But it's pretty much the case that performance has
doubled every couple of years.
Nobody really believes that Moore's law will continue although it's pretty
amazing that its demise keeps getting
In message 4a30d1df.9656%hideki_ka...@ybb.ne.jp, Hideki Kato
hideki_ka...@ybb.ne.jp writes
Auch,
You know German as well as English?
Japanese computer Go developers will have CGF Open computer
Go tournament on June 20th and 21st.
#CGF stands for Computer Go Forum (Japan).
12 matches
Mail list logo
