Increasing KOMI is much easier than placing stones, right?
Jacques Basaldúa³ñ <[EMAIL PROTECTED]>:
>I would like to take part in the 19x19 competition.
>I also prefer kyu rating to Elo, but I got the impression that
>you were relating kyu rating with handicap games (that is
>usually done by huma
Stuart A. Yeates³ñ <[EMAIL PROTECTED]>:
>Increasing komi is much easier than placing stores, but a much weaker
>representation of how go games are actually played in the real world.
Agree. But we'd better not to be bothered by fixed stones now, I
believe.
>cheers
>stuart
Don Dailey: <[EMAIL PROTECTED]>:
>On the web I see that some ELO based GO servers assume 100 ELO is 1
>rank, and do exactly what I proposed, when they handicap they fold
>this into the ELO rating of the players for rating purposes.
In Nihon Kiin's ELO system(1), 1000 ELO is 1 rank, ex 25kyu is
[
PS3's main memory is, however, 256MB which seems not enough.
John Tromp: <[EMAIL PROTECTED]>:
>On 1/5/07, Darren Cook <[EMAIL PROTECTED]> wrote:
>
>> The playstation multiprocessing looks very different: you get 1 general
>> purpose CPU and 6 specialized CPUs. Their key feature is they have 256K
>
See
http://www.mail-archive.com/computer-go@computer-go.org/msg04946.html
This link helps not only 19x19 but also 9x9 for Windows users.
-Hideki
ivan dubois: <[EMAIL PROTECTED]>:
>Hello,
>
>I downloaded the file "cgosGtp-win.zip" from http://cgos.boardspace.net/ but I
>cant make it
>work. I am
ect program to 19x19 server"?
-Hideki
>- Don
>
>
>Hideki Kato wrote:
>> See
>> http://www.mail-archive.com/computer-go@computer-go.org/msg04946.html
>>
>> This link helps not only 19x19 but also 9x9 for Windows users.
>>
>> -Hideki
>>
>&g
t played
>more human-like ?
Yes, certainly.
I've tried and posted the use of tanh(K * score) to this list on Dec
13, as well.
Hideki Kato: <[EMAIL PROTECTED]>:
>Hi Begué and Don,
>
>I did this in my earlier version of ggmc. The real code was:
>
>reward = 0.5 * (1 +
Don Dailey: <[EMAIL PROTECTED]>:
>
>
>[EMAIL PROTECTED] wrote:
>>> I experimented with something similar a while ago, using the
>>> publicly available mogo and manipulating komi between moves.
>>>
>>> If its win probability fell below a certain threshold (and the move
>>> number wasn't too high), I
Gian-Carlo Pascutto: <[EMAIL PROTECTED]>:
>Hideki Kato wrote:
>
>> delta_komi = 10^(K * (number_of_empty_points / 400 - 1)),
>> where K is 1 if winnig and is 2 if loosing. Also, if expected
>> winning rate is around 50%, Komi is unmodified.
>
>I don'
Don Dailey: <[EMAIL PROTECTED]>:
>
>Hideki Kato wrote:
>> Don Dailey: <[EMAIL PROTECTED]>:
>>
>>> [EMAIL PROTECTED] wrote:
>>>
>>>>> I experimented with something similar a while ago, using the
>>>>> publi
Gian-Carlo Pascutto: <[EMAIL PROTECTED]>:
>Hideki Kato wrote:
>> Gian-Carlo Pascutto: <[EMAIL PROTECTED]>:
>>> Hideki Kato wrote:
>>>
>>>> delta_komi = 10^(K * (number_of_empty_points / 400 - 1)),
>>>> where K is 1 if winnig and is
[EMAIL PROTECTED]: <[EMAIL PROTECTED]>:
>> delta_komi = 10^(K * (number_of_empty_points / 400 - 1)),
>> where K is 1 if winnig and is 2 if loosing. Also, if expected
>> winning rate is between 45% and 65%, Komi is unmodified.
>
>There's one thing I don't like at all, there: you could get positive
Thanks Heikki, this is what I'm trying to write in English right
now :).
-Hideki
Heikki Levanto: <[EMAIL PROTECTED]>:
>On Mon, Mar 03, 2008 at 12:15:36PM -0800, Christoph Birk wrote:
>>
>> On Mon, 3 Mar 2008, Don Dailey wrote:
>> >What you are trying to do is more in the category of opponent
>>
I'd like to give here an example to make things clear.
The conditions are:
1) Using digitizing scheme that maps real score to [0,1] (or [-1,1])
so that the program cannot distinguish losing/winning by 0.5 or 10.5
pt at all.
2) Playouts include some foolish moves (usually with low
but not zero p
Don Dailey: <[EMAIL PROTECTED]>:
>
>
>Hideki Kato wrote:
>> I'd like to give here an example to make things clear.
>>
>> The conditions are:
>> 1) Using digitizing scheme that maps real score to [0,1] (or [-1,1])
>> so that the program cannot d
terry mcintyre: <[EMAIL PROTECTED]>:
>I attempted to access the games of IaGoChall, and
>could not; the KGS client beeped at me.
>
>Is there a method to review the game records?
We can download but cannot review the records directly. Watch them
at offline.
-Hideki
>Thanks!
>
>
>Terry McIntyre
David Fotland: <[EMAIL PROTECTED]>:
>I just looked at this position and it looks like a win for black in the
>first position. Many Faces evaluates it as a win for black, and plays c1 to
>save the lower left black group with almost no thinking time.
>
>Mogo is correct because the lower left black g
David Fotland: <[EMAIL PROTECTED]>:
>The Ing prize stopped when Mr Ing died. He was very interested in computer
>go. His foundation still funds many go tournaments, but none for computers.
>
>The current computer go tournaments I know of are:
>
>European go congress (Late July)
>US go congress (
Hello,
I have the same problem with version 7.0.7 of Adobe Reader but
version 8.1.2 works fine.
Hope this helps,
Hideki
steve uurtamo: <[EMAIL PROTECTED]>:
>Hello,
>
>I'm getting the same thing here in windows:
>
>"Cannot extract the embedded font..."
>
>Was it made with pdflatex or somesuch? C
terry mcintyre: <[EMAIL PROTECTED]>:
>
>--- Erik van der Werf <[EMAIL PROTECTED]>
>wrote:
>
>> On Sat, May 3, 2008 at 8:49 AM, Joshua Shriver
>> <[EMAIL PROTECTED]> wrote:
>> > Is there a computer go forum?
>>
>> http://www.computer-go.jp/
Thank you for remembering and annoucement of our forum, E
David Fotland: <[EMAIL PROTECTED]>:
>The scalability study showed that mogo gains almost 100 rating points per
>doubling of performance.
>
>But on CGOS, there is mogo 1 CPU and mogo 4 CPU. I would expect the 4 CPU
>mogo to be 150 rating points or more higher than 1 CPU. But it is actually
>only 4
Olivier Teytaud: <[EMAIL PROTECTED]>:
>> One reason of this discount is that the MoGo bros running on cgos are
>> the _big versions. By my obserbation (they are running on my pcs and
>> both are Q6600/3GHz with different mother boards), mogo_big_4core's
>> perallelism is around 300% (by top comman
Today, at the 18th World Computer Shogi Championship, top two
programs won against top amateur palyers in exihibition.
http://www.computer-shogi.org/index_e.html
The result of the tournament is here.
http://www.computer-shogi.org/wcsc18/index_e.html
You can replay the exhibition games here (in J
Mark Boon: <[EMAIL PROTECTED]>:
>
>On 4-mei-08, at 14:57, Hideki Kato wrote:
>
>> By my obserbation (they are running on my pcs and
>> both are Q6600/3GHz with different mother boards), mogo_big_4core's
>> perallelism is around 300% (by top command), perhap
Álvaro Begué: <[EMAIL PROTECTED]>:
>Ooops! I hit sent before I finished writing the pseudo code. Sorry.
>
>int pick(Move *empties, int num_empties) {
> int num_candidates = num_empties;
> int picked;
>
> while(1) {
> picked = rand()%num_candidates;
This code introduces few bias unless num_candi
z; z = w;
return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}
-Hideki
Álvaro Begué: <[EMAIL PROTECTED]>:
>On Tue, May 13, 2008 at 11:57 PM, Hideki Kato <[EMAIL PROTECTED]> wrote:
>>
>> Álvaro Begué: <[EMAIL PROTECTED]>:
>> >Ooops! I hit sent
David, I just remembered that the scalability test was done without
any opening book!
This could be the reason of their different scalablities.
-Hideki
David Fotland: <[EMAIL PROTECTED]>:
>The scalability study showed that mogo gains almost 100 rating points per
>doubling of performance.
>
>But
I also am not an expert of pseudo random number generator, Heikki.
It's very hard to estimate the effect of the quality of PRNG in MC
simulations. The only way is to compare their performance using your
program, I believe.
I know that the generating speed of SFMT, about one nano second each
o
Peter, I've checked the game record and felt nothing unnatural as
a classical weaker bot.
#I've played against AyaBot series (AyaBot, AyaBot2...4) 59 games
in total on KGS.
Please note that AyaBot (not AyaMC) is not an MC bot but a classical
one. Its moves are generated by patterns and selecte
Following url may help.
http://softwarecommunity.intel.com/isn/Community/en-US/forums/thread/30235396.aspx
-Hideki
Michael Williams: <[EMAIL PROTECTED]>:
>I don't think Don was saying to use many calls to RDTSC to generate a single
>random number.
>I think he meant do something like (FastBadRand
Dear CGOS watchers, :)
Mogo-pr-4core is the public release (not big float) version of MoGo
and running on Intel Q9550, latest 45nm chip of Core2 micro
architecture with larger L2 cache (2 x 6MB), at 3.4 GHz (8.5
x 400MHz; overclocked from rated 2.83GHz) on ASUS
P5K-VM motherboard.
Its perform
CSA World Computer Shogi Championships
http://gamelab.yz.yamagata-u.ac.jp/SHOGI/CSA2008/18csa.html
-Hideki
Hideki Kato: <[EMAIL PROTECTED]>:
>Today, at the 18th World Computer Shogi Championship, top two
>programs won against top amateur palyers in exihibition.
>http://www.com
Gunnar Farnebäck: <[EMAIL PROTECTED]>:
>Hideki Kato wrote:
> > I didn't against you, Álvaro, rather I just made a caution for
> > programmers who will use your pseudo code as is. :)
> >
> > First, I prefer SFMT (SIMD-oriented Fast Mersenne Twister) rather
n N. Use trancate instead for the range [0..N).
#I used float instead of double and also got N (very rare). Please be
careful.
-Hideki
Gunnar Farnebäck: <[EMAIL PROTECTED]>:
>Hideki Kato wrote:
>> Gunnar Farnebäck: <[EMAIL PROTECTED]>:
>>> Hideki Kato wrote:
>>
Gunnar Farnebäck: <[EMAIL PROTECTED]>:
>I wrote:
> > Hideki Kato wrote:
> >> Gunnar Farnebäck: <[EMAIL PROTECTED]>:
> >>> Hideki Kato wrote:
> >>>> I didn't against you, Álvaro, rather I just made a caution for
> >>>&g
gned long x=123456789,y=362436069,z=521288629,w=88675123;
unsigned long t;
t=(x^(x<<11));x=y;y=z;z=w; return( w=(w^(w>>19))^(t^(t>>8)) );
}
http://www.jstatsoft.org/v08/i14/
This shows SFMT/SSE2 is the fastest and twice faster than xor_shift
(at least on that enviro
thing is that mogo_big_2c seems not weaker
than mogo-big-4core.
http://cgos.boardspace.net/9x9/standings.html
-Hideki
Hideki Kato: <[EMAIL PROTECTED]>:
>David, I just remembered that the scalability test was done without
>any opening book!
>
>This could be the reason of their diff
Thank you for a long, very interesting report, Nick.
I found a typo(?), however, about the version of HBotSVN. Jason wrote
earlier games were played by r761 but you wrote by r763.
-Hideki
Nick Wedd: <[EMAIL PROTECTED]>:
>In message
><[EMAIL PROTECTED]>, Jason
>House <[EMAIL PROTECTED]> writes
>>>while(((white_pass && black_pass ) == true) || tree_deep == 1000)
"while" should be "until".
-Hideki
WSK: <[EMAIL PROTECTED]>:
>Am 17.06.2008, 20:37 Uhr, schrieb Zach Wegner <[EMAIL PROTECTED]>:
>
>> On Mon, Jun 16, 2008 at 4:42 PM, WSK <[EMAIL PROTECTED]>
>> wrote:
>>
>>> program oh
I strongly believe Gifu Challenge will not come back any more.
#Please attend The 2nd UEC Cup, planned on December 13-14, 2008,
instead.
-Hideki
David Fotland: <[EMAIL PROTECTED]>:
>Is there any word on the Gifu tournament in Japan, which is usually in
>September?
>
>David
>
>> -Original Mes
Magnus,
I'd like to provide my quad core pc to run Valkyria on cgos 9x9.
It, however, will be used for my reseach experiments sometimes.
If you could allow this, please send its binary for Linux to me.
-Hideki
Magnus Persson: <[EMAIL PROTECTED]>:
>I also see myself listed in the EGC tourname
I'm afraid that kartoffel may cause some confusion on the ratings.
I've set mogo-big-4c-nb-32 never resign but this will help little.
I'd like to prefer every program never resign until the author of
kartoffel fix the bug to prevent the ratings being corrupted.
-Hideki
John Fan: <[EMAIL PROTE
The next time I run the all time rating list, I will see what happens
>if I ignore kartoffel's games - just to see if this has much of an
>impact.
>
>- Don
>
>
>
>
>Hideki Kato wrote:
>> I'm afraid that kartoffel may cause some confusion on the rating
d games.
Nice idea, I believel this will work well. Thank you, Don.
-Hideki
>- Don
>
>
>
>
>
>
>
>
>Hideki Kato wrote:
>> Don Dailey: <[EMAIL PROTECTED]>:
>>
>>> I don't think this has a very large impact on the rating pool.
Though my program is not strong :), I bet new algorithms.
Especially, better (heavy)-playout with not only spatial features
but also temporal ones, which gives small error of the score, and
better uct part with some enhancement, perhaps, with RL.
-gg
Darren Cook: <[EMAIL PROTECTED]>:
>I have a
Mark Boon: <[EMAIL PROTECTED]>:
>Opposed to removing 9x9.
>
>In favor of adding 13x13 wthout removing 9x9.
Me too. If, however, limited two 9x9 and 13x13 might be better now as
19x19 is not so utilized, IMHO. It's just early this year many
programs started being running on 9x9.
I will donate
Don,
Why we have to have three servers for three boardsizes? Isn't it
possoble to build a server that handle any boarsize?
-Hideki
Don Dailey: <[EMAIL PROTECTED]>:
>There has been some discussion about which additional board sizes to use
>for the server once it is running.
>
>Of course runn
David Fotland: <[EMAIL PROTECTED]>:
>I keep liberty counts.
Me too. Also is Hiroshi.
-Hideki
>David
>
>> -Original Message-
>> From: [EMAIL PROTECTED] [mailto:computer-go-
>> [EMAIL PROTECTED] On Behalf Of Jason House
>> Sent: Saturday, August 02, 2008 6:43 AM
>> To: computer-go
>> Subj
: <[EMAIL PROTECTED]>:
>Can you describe your algorithms?
>
>Cheers,
>Lukasz
>
>On Sat, Aug 2, 2008 at 19:36, Hideki Kato <[EMAIL PROTECTED]> wrote:
>> David Fotland: <[EMAIL PROTECTED]>:
>>>I keep liberty counts.
>>
>> Me too. Al
Don,
This problem can only be relevant to the routers built on Linux. If
the server site uses Linux router(s) then this may be relevant.
Servers and clients themselves are not relevant anyway.
-Hideki
Don Dailey: <[EMAIL PROTECTED]>:
>I am looking at this page:
>
>http://cryp.to/publi
tops this problem. If it does, this is at least a strong
>indication that log periods of inactivity triggers the problem.
>
>- Don
>
>
>
>On Sun, 2008-08-10 at 01:40 +0900, Hideki Kato wrote:
>> Don,
>>
>> This problem can only be relevant to the routers bui
Hi all,
I'd like to say first "Congratulations!" to MoGo team.
I have a question. Why do you all call the game as "human vs.
computer"? It's obviously a match between Kim 8p and MoGo, a program
developped by MoGo team, running on a supercomputer.
As both MoGo and the supercomputer were develop
Hi Darren,
Darren Cook: <[EMAIL PROTECTED]>:
>> I have a question. Why do you all call the game as "human vs.
>> computer"? It's obviously a match between Kim 8p and MoGo, a program
>> developped by MoGo team, running on a supercomputer.
>
>Quick answer: it is the established term. ("human-mac
Don Dailey: <[EMAIL PROTECTED]>:
>On Tue, 2008-08-12 at 09:55 +0900, Darren Cook wrote:
>> > [The pro] was also a bit "unlucky" in the sense that Leela did not
>> > understand it
>> > was dead lost.
>> >
>> > I use quotes because had it understood better it was losing, it would have
>> > put up
e greeted ...
>
>Cheers,
>David
>
>
>
>On 11, Aug 2008, at 8:37 AM, Hideki Kato wrote:
>
>> Hi all,
>>
>> I'd like to say first "Congratulations!" to MoGo team.
>>
>> I have a question. Why do you all call the game as "hum
Don Dailey: <[EMAIL PROTECTED]>:
>On Tue, 2008-08-12 at 11:50 +0900, Darren Cook wrote:
>> > Also, if you are down 8 or 9 stones, maximizing your winning chances is
>> > still the right strategy, right?
>>
>> With MCTS algorithms the error margin is high at the start of the game,
>> and low in
Darren Cook: <[EMAIL PROTECTED]>:
>> It does not change the fact MoGo was developped by the programmers.
>> And the fact the programmers spent many resources, like the people
>> fighting at Beijing right now, to develop MoGo.
>
>And Kim was developed by his parents, his go teachers, go books, an
Rémi Coulom: <[EMAIL PROTECTED]>:
>Gian-Carlo Pascutto wrote:
>>
>> The *paper* about MTD(f) is extremely interesting because it shows
>> that many best-first algorithms can be rewritten as depth-first
>> algorithms.
>>
>> It happened for SSS, it happened for proof-number search.
>>
>> Who will m
Hideki Kato: <[EMAIL PROTECTED]>:
>Rémi Coulom: <[EMAIL PROTECTED]>:
>>Gian-Carlo Pascutto wrote:
>>>
>>> The *paper* about MTD(f) is extremely interesting because it shows
>>> that many best-first algorithms can be rewritten as depth-first
Zach Wegner: <[EMAIL PROTECTED]>:
>Interesting. Could you (or someone else) explain how DFUCT works? I'd
>imagine it doesn't save all the nodes in memory, but that seems rather
>counterintuitive.
As far as I understand,
The basic idea is that DFUCT continues searching avoiding going back
to root
Oops.
Hideki Kato: <[EMAIL PROTECTED]>:
>Zach Wegner: <[EMAIL PROTECTED]>:
>>Interesting. Could you (or someone else) explain how DFUCT works? I'd
>>imagine it doesn't save all the nodes in memory, but that seems rather
>>counterintuitive.
>
>
Bob Hearn: <[EMAIL PROTECTED]>:
>The MoGo programmer who answered questions after the match (Olivier
>Teytaud) did state that MoGo no longer used UCT. He gave a one-line
>statement of the reason they switched, which I did not follow.
The first post Olivier wrote they no longer used UCT is:
htt
Magnus Persson: <[EMAIL PROTECTED]>:
>Quoting Don Dailey <[EMAIL PROTECTED]>:
>
>> Yes, UCT is easier to use with multiple CPU's because with additional
>> processors alpha-beta programs do wasted work, unless you are talking
>> about theoretical programs with perfect move ordering, which you aren'
searcher does blind search and pushes the same
positions "delay" times.
Hideki
>On Wed, Aug 13, 2008 at 9:20 AM, Hideki Kato <[EMAIL PROTECTED]> wrote:
>> Magnus Persson: <[EMAIL PROTECTED]>:
>>>Quoting Don Dailey <[EMAIL PROTECTED]>:
>>>
>
Magnus Persson: <[EMAIL PROTECTED]>:
>Quoting Hideki Kato <[EMAIL PROTECTED]>:
>
>> Yes, UCT does. From my recent experiments with a delay
>> line (a fixed size FIFO queue) between a UCTsearcher and an MC
>> simulator with RAVE against GNU Go 3.7.11 level 0 on
Hi Darren,
Darren Cook: <[EMAIL PROTECTED]>:
>Hideki Kato wrote:
>> queue overflows. So, the searcher selects optimal arcs based on the
>> older results of simulations by "delay" times. Especially at
>
>Hi Hideki,
>You have used the word "arc&qu
Don Dailey: <[EMAIL PROTECTED]>:
>Why don't we leave it up for another month or
>two and see if it's being used. If there are no opponents, even if
>someone wants to use it they won't be able to unless they provide their
>own opponents.
In addition, there are no anchors so long :(
May it be be
Don Dailey: <[EMAIL PROTECTED]>:
>It's difficult for me to understand this due to different ranking
>systems and pro ratings vs amateur ratings. I see here listed as a 4
>dan player on this page:
>
>http://www.nihonkiin.or.jp/player/htm/ki000343.htm
>
>
>Is that 4 dan pro? My understanding
Christoph Birk: <[EMAIL PROTECTED]>:
>On Fri, 5 Sep 2008, Magnus Persson wrote:
>> I will also run Valkyria on CGOS 13x13 over the weekend, (or long as things
>> are stable).
>
>One anchor would be nice.
OK, I will run Gnugo-3.7.10-a4 soon.
Hideki
>Christoph
>
>_
I restarted FatMan-1 now.
Hideki
David Fotland: <[EMAIL PROTECTED]>:
>
>
>___
>computer-go mailing list
>computer-go@computer-go.org
>http://www.computer-go.org/mailman/listinfo/computer-go/
--
[EMAIL PROTECTED] (Kato)
__
Rémi Coulom: <[EMAIL PROTECTED]>:
>I'll run tests to try to figure out how much strength is lost by
>parallelization (ie, what is the winning rate of 10,000 sequential
>playouts vs 1,000 playouts over 10 processors). Hideki ran similar tests
>against GNU Go, and found 25 Elo loss with 4 CPUs. S
Olivier Teytaud: <[EMAIL PROTECTED]>:
>>
>>
>> By my recent experiments, 8~9 * (threads - 1) ELO is lost. This
>> matches my earlier result well.
>>
>
>Do you have tricks for avoiding redundancies between simulations ?
Yes. I use Sylvain's fpu and decrease it a little before starting a
simulat
Don Dailey: <[EMAIL PROTECTED]>:
>Who is running the 13x13 anchor? It is hung and needs to be restarted.
It's me and restarted right now.
Hmmm, I cannot find any strange things in the log file. My guess is
that there are no players other than the anchor running for a while
and the match serv
Olivier Teytaud: <[EMAIL PROTECTED]>:
>>
>>
>> Yes. I use Sylvain's fpu and decrease it a little before starting a
>> simulation, say, fpu *= 0.99. This is very simple and fast.
>
>
>Ok. Perhaps I'm wrong (I might misunderstand your solution and I might be
>wrong
>whenever I've understood :-) );
Olivier Teytaud: <[EMAIL PROTECTED]>:
>>
>>
>> Although I'm parallelizing in not SMP systems but a cluster of loosely
>> coupled (small) computers connected through moderate speed networks
>> using broadcasting positions, this may not change the vlaue of
>> avoiding redundancies. I'll study more
Christoph Birk: <[EMAIL PROTECTED]>:
>On Tue, 9 Sep 2008, Olivier Teytaud wrote:
>> testbed for
>> parallelization because it's more difficult) and as "real" targets (as there
>> are players
>> for both).
>
>Sorry, but there are (almost) no players for 9x9. To repeat
>D.Fotland's earlier comment: 9
ed out that there was a remarkable correlation, although no
>doubt some players who specialize at different time controls would have
>an edge.
>
>- Don
>
>
>
>On Wed, 2008-09-10 at 11:27 +0900, Hideki Kato wrote:
>> Christoph Birk: <[EMAIL PROTECTED]>:
>> &
Erik van der Werf: <[EMAIL PROTECTED]>:
>Maybe these are the same?
>
>http://gobase.org/9x9/
Yes but a part. Unfortunatelly, whole records is temporary not
available. Following is the reason (and history) which I can remember
now.
All records were published (but not sold) in a few booklets.
David Fotland: <[EMAIL PROTECTED]>:
>At this point I think everyone would agree that E5 is the optimal first move
>for black on 9x9.
Some Japanese professionals say E5 is 1 to 2 points loss, though komi
is 6.5 and with Japanese rules.
>Now that I have deeper and more accurate search, my engine f
Japanese rules have two procedures to stop the game and to verify
the score (these names are my personal, not official).
In the case you mentioned, your opponent has no needs to remove the
stones, if he/she thought the stones are dead (exactly speaking,
he/she _can_ make the stones dead).
So,
Hi Nick,
Thank you for origanizing the tounaments.
However, the hardware I (FudoBot) used is wrong. It was running on a
loosely coupled cluster of four PCs connected through a usual Gigabit
Ethernet LAN. Each PC has one Intel Core2Quad processor running at
3GHz. So, 16 cores in total.
Th
David Doshay: <[EMAIL PROTECTED]>:
>It was 800, just like last time, but the networking had been upgraded
>from ethernet to infiniband. Olivier said that this should have been a
>good improvement because he felt that communication overhead was
>significant.
Really previous Huygens used Ethe
r hardware" Olivier wrote.
Hideki
David Doshay: <[EMAIL PROTECTED]>:
>On 22, Sep 2008, at 10:50 PM, Hideki Kato wrote:
>>
>> David Doshay: <[EMAIL PROTECTED]>:
>>> It was 800, just like last time, but the networking had been upgraded
>>> fro
Nick Wedd: <[EMAIL PROTECTED]>:
>Does anyone have any information on the results of [the computer Go
>aspects of] these events?
>
>Cotsen go tournament 2008
>September 20 & 21
>http://www.cotsengotournament.com/ treats it as being in the future
>
>Jiuding Cup
>September 22-26
>http://219.142.86.
Don Dailey: <[EMAIL PROTECTED]>:
>On Thu, 2008-10-02 at 19:17 +0200, Michael Markefka wrote:
>> So, when are we going to see distributed computing? [EMAIL PROTECTED],
>> [EMAIL PROTECTED], [EMAIL PROTECTED] With Go engines that scale well to
>> increased
>> processing capacity, imagine facilita
I don't know the detail but the cluster (or the connection) had some
trouble and the play-off will be resumed this morning (at Beijing
time; +0800).
Hideki
Ingo Althöfer: <[EMAIL PROTECTED]>:
>Olivier Teytaud wrote here:
>> ... and good luck for both MoGo and Leela for
>> the silver medal in 9x9
David Fotland: <[EMAIL PROTECTED]>:
>Gostar and Yogo were also classical on 19x19. Yogo was MCTS on 9x9. I
>don't know about Break. Gostar's author said he will now rewrite to use
>MCTS.
Break is not MCTS. The author of NineHeadBird also said he will
rewrite and attend next year.
Hideki
>It
SIMD version of SFMT is 3 to 7 time faster than MT. See
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/speed.html
for detail.
Hideki
Don Dailey: <[EMAIL PROTECTED]>:
>On Thu, 2008-10-09 at 15:20 -0400, [EMAIL PROTECTED] wrote:
>> Computers + random = can of worms.
>
>Has anyone seen this:
The 2nd GPW Cup Gomputer Go Tournament will be held as a night event
of Game Programming Workshop 2008.
GPW2008: http://sig-gi.c.u-tokyo.ac.jp/gpw/2008/ (in Japanese)
#Those who can't read Japanese and have interests in paticipating GPW
Cup Computer Go Tournament, please mail me.
The 13th Game
Hi all,
Here are some pictures on my thirteen days trip to World 9 x 9
Computer GO Championship (Tainan, Taiwan) and ICGA International
Computer Games Champioinship (Beijing, China).
http://www.gggo.jp/13days/
The official pages for the Tainan and Beijing tournaments are
http://go.nutn.edu.tw/
Seems Ito-sensen is very busy...
The committee prepares a very limited number of volunteer operators.
See "4-3 Volunteer Operators" at
http://jsb.cs.uec.ac.jp/~igo/2008/eng/sankayouken.html for detail.
Hideki
David Fotland: <[EMAIL PROTECTED]>:
>Do we have to show up in person, or can our pro
Seems Ito-sensei is very busy...
Remote computing is allowed. See "1-4: Using a Remote Host via the
Internet" at http://jsb.cs.uec.ac.jp/~igo/2008/eng/sankayouken.html
("Requirements for participation" in the side menu) for detail.
Hideki
David Doshay: <[EMAIL PROTECTED]>:
>Will remote comput
open next year and hope that you will be
>holding
>the tournament again at that time.
We look forward you and SlugGo next year. This tournament will be
held on weekend every early December but not guaranteed.
You are welcome,
Hideki
>Thank you,
>David
>
>
>
>On 28, Oc
llowing conditions will be applied.
>The operator must input a move designated by the program.
>If he/she input different moves, the competitor loses the game immediately.
>The time to input moves is also clocked.
>
>
>
> Terry McIntyre <[EMAIL PROTECTED]>
>
&g
Thank you Eric,
GGMC and FudoGo ('Fudo Go' is proper like 'GNU Go') support only
Linux. The Elo rating of FudoGo v3 is between 2000 and 2100 on CGOS
9x9 using four cores.
Hideki
Eric Marchand: <[EMAIL PROTECTED]>:
>Hi all,
>Here is a list of 24 free go engines (18 with source):
>http://ricoh5
Hello Ingo,
You (we) have to adjust one point if a game ends by black in usual
(no seko etc) cases. As Japanese doesn't count dame while Chinese
does, if a game ends by black, black gets one more point under Chinese
rules than Japanese.
Hideki
Ingo Althöfer: <[EMAIL PROTECTED]>:
>Hello all, two
Hi,
This is my GPW08 paper.
Parallel Monte-Carlo Tree Search with Simulation Servers
by Hideki Kato and Ikuo Takeuchi
Abstract: Recently Monte-Carlo tree search is boosting the performance
of computer Go playing programs. A novel parallel Monte-Carlo tree
search algorithm is proposed. A tree
Program Operator Country Hardware Win Type
1 MoGo Arpad Rimmel France 4x3 GHz9 MCTS
2 Aya Hiroshi Yamashita Japan 8x2.6 GHz 8 MC/UCT
3 Fudo Go Hideki Kato Japan 4x3.4 GHz 7 MC/UCT
4 JimmyShun-Chin Hsu Taiwan laptop 6 MC/UCT
Hello Heikki,
Heikki Levanto: <[EMAIL PROTECTED]>:
>On Sat, Nov 15, 2008 at 11:38:34PM +0100, [EMAIL PROTECTED] wrote:
>> Being a computer scientist but new to go, i can grasp some of the theory.
>> The question I was trying to get across was:
>>
>> In a game of self play, if both parties are emp
Nick Wedd: <[EMAIL PROTECTED]>:
>My report on Sunday's KGS bot tournament is now available at
>http://www.weddslist.com/kgs/past/44/index.html
>Many Faces of Go was undefeated in both divisions.
Did Many Faces 1 and 2 share the same cluster or one for each?
Hideki
--
[EMAIL PROTECTED] (Kato)
1 - 100 of 454 matches
Mail list logo
