Does someone here know the exact starting times (in common
time zones) for the 19x19 exhibition games
* Chou(9p) vs MFoG (Fr, August 21)
* Chou(9p) vs Zen (Sa, August 22)
?
Thx in advance.
Ingo.
PS: I will reply later to the interesting postings by Brian Sheppard
and Weston Markham on
On Thu, Aug 20, 2009 at 10:47:12AM +0200, Ingo Althöfer wrote:
Does someone here know the exact starting times (in common
time zones) for the 19x19 exhibition games
* Chou(9p) vs MFoG (Fr, August 21)
* Chou(9p) vs Zen (Sa, August 22)
?
Hi!
Where were these announced? On what server will
The timezone of Korea is the same as Japan (GMT+0900). In addition,
Korea has no daylight-saving, I strongly believe but not guranteed,
sigh.
Hope this helps.
Hideki
Ingo Althöfer: 20090820084712.136...@gmx.net:
Does someone here know the exact starting times (in common
time zones) for the
I'm curious to find out what is meant by lazy. If, as I am led to
believe by your report, Monte Carlo strategies applied to Double Step
Races are lazy, yet they converge to perfect play, then I'm not sure
why we are meant to worry.
We worry because the 7 facts below combine to propagate bad
steve uurtamo wrote:
zen wins many more of its even games with no handicap than it does
with even, say, an even 2 stone handicap as either black or white. i
haven't compiled numbers for it (i'm not zen's maintainer), but i
watched it happen over the course of about 50 games one day. it was
I'm glad to see some are actually experimenting with this.
My suggestion is to modify a program such as fuego to follow one of the
algorithms as suggested - then test it with a large sample of games. If
it doesn't work we can experiment until it does or until we are satisfied
that it won't.
Yamato: 4a8d2cc8.29578c0a.3f87.6...@mx.google.com:
steve uurtamo wrote:
zen wins many more of its even games with no handicap than it does
with even, say, an even 2 stone handicap as either black or white. i
haven't compiled numbers for it (i'm not zen's maintainer), but i
watched it happen over
I changed my search from one tree per search thread to a shared (lock-
free) tree among all threads. Back with dedicated trees, I would set a
visited flag as I walked the tree. With a shared tree are there any
clever ways to detect cycles / super ko?
Here are the two ideas I'm thinking of:
On Thu, Aug 20, 2009 at 9:06 AM, Jason Housejason.james.ho...@gmail.com wrote:
I changed my search from one tree per search thread to a shared (lock-free)
tree among all threads. Back with dedicated trees, I would set a visited
flag as I walked the tree. With a shared tree are there any clever
