Nick Wedd | 22 Oct 14:13 2014

Date of November KGS bot tournament

At present, the  November KGS bot tournament is scheduled for Sunday
November 9th, starting at 08:00 UTC.  Hideki Kato has pointed out to me
that this clashes with the Game Programming Workshop 2014 (GPW-14) on
November 7th-9th, making it difficult for Japanese programmers to
enter. I therefore propose postponing it to November 16th, starting at
11:00 UTC, and probably ending at 17:00 UTC (I will be on holiday with
friends, making a start at 08:00 UTC difficult for me).

If any of you are planning to enter but find this date impossible,
please let me know soon, and I will try to find a better date.


Nick Wedd
nick <at>
Nick Wedd | 13 Oct 17:10 2014

Congratulations to Fuego!

Congratulations to Fuego9, winner of yesterday's KGS bot tournament!

The results are at
and as usual I welcome your corrections and comments.


Nick Wedd
nick <at>
Nick Wedd | 5 Oct 16:37 2014

October KGS bot tournament: 9x9

The October KGS bot tournament will be held on Sunday October 12th,
starting at 16:00 UTC and ending at 23:00 UTC.  It will use 9x9
boards,  with time limits of 9 minutes each plus very fast Canadian
overtime, and komi of exactly 7.  There are details at .

Please register by emailing me, with the words
"KGS Tournament Registration" in the email title, at
maproom <at> .


Nick Wedd
nick <at>
"Ingo Althöfer" | 1 Oct 18:34 2014

Interviews on codecentric Challenge


on Saturday, October 04, the first game of the 
codecentric Challenge 2014 between Franz-Josef Dickhut
(German 6-dan) and Remi Coulom's CrazyStone will be played.

Dr. Raymond-Georg Snatzke has interviewed both FJ and Remi.
Read here:

Cheers, Ingo.
Mark Lass | 30 Sep 14:09 2014

Convert Nemesis .GAM file to .sgf

Does anyone have a file converter to convert Nemesis .GAM files to .sgf? Or have the specs on the .GAM (Binary) file format?



Mark Lass

Computer-go mailing list
Computer-go <at>
Joshua Shriver | 28 Sep 05:16 2014

CGOS update

Just renewed the domain for another 2 years. TY very much donors!


P.S.  Anyone in the group know TCL?  I'm not bad at learning new
languages (tend to be the same) but could use some TCL help.

Perhaps my #1 request is someone with a Mac.   I can rebuild the
Linux/Windows packages, but could really appreciate someone w/ a Mac
and could download the TCL/build let me email them source (or
download) and build it for distribution. If you need help perhaps I
can walk you thru it. Will definitely note your contribution!

P.S.S.   Anyone recommend some FREE 19x19 engines.  I've post once or
twice, but still didn't see a link or find info for them.  A year or
so back both 9x9 and 19x19 was available on the wiki.  I have the 9x9
now and fusing into the server while trying to respect the original
rating for anchor.  Still need some 19x19s to run since that seems the
2nd (tie w/ 1st) most used.   Kinda giving up on 13x13 till the others
are smooth.
Peter Drake | 27 Sep 01:48 2014

History of program strength

I'm giving a talk on computer Go (and how to play Go) to a regional computer science conference in a couple of weeks.

Has anyone compiled a table or graph of the best programs' strength over time? Ideally it should make the jump after Monte Carlo clear.

I am aware of these: (only goes back to 2007) (a bit difficult to condense into a single line graph)
Computer-go mailing list
Computer-go <at>
Alexander Terenin | 26 Sep 00:28 2014

Bayeisan/Probablistic Playouts in Computer Go

Hello everybody,

I’m a PhD student in statistics at the University of California, Santa Cruz who previously worked on the
Go program Orego, currently in the process of applying for the NSF fellowship. I am working on a Bayesian
statistics - related research proposal that I would like to use in my application, and wanted to know if
someone was aware of any research related to my topic that has been done.

Currently, it seems most MCTS-based Go programs, in the playouts, treat the strength (win rate) of each
move as a fixed, unknown value, which is then estimated using frequentist techniques (specifically, by
playing a random game, and taking the estimate to be wins / total runs). Has anyone attempted to instead
statistically estimate the strength of each move using Bayesian techniques, by defining a set of prior
beliefs about the strength of a certain move, playing a random game, and then integrating the information
gained from the random game together with the prior beliefs using Bayes' Rule? Equivalently, has anyone
defined the strength of each move to be a random variable rather than a fixed and unknown value? Without
making this email too long, there’s some theoretical advantages that might allow for more information
to be extracted from each playout if this setup is used.

If you are aware of any work in this direction that has been done, I would love to hear from you! I’ve been
looking through a variety of papers, and have yet to find anything - it seems that any work remotely related
to Bayes’ Rule has concerned the tree, not the playouts.
Thank you in advance,

Alex Terenin​
aterenin <at>​
Computer-go mailing list
Computer-go <at>
liezelle | 22 Sep 14:17 2014

Last CFP - Third International Conference on Informatics & Applications, Malaysia

All registered papers will be included in SDIWC Digital Library, and in 
the proceedings of the conference.

TITLE: The Third International Conference on Informatics & Applications 

EVENT VENUE: Universiti Sultan Zainal Abidin (UniSZA), Kuala Terengganu, 

CONFERENCE DATES: October 8-10, 2014


OBJECTIVE: To provide a medium for professionals, engineers, 
academicians, scientists, and researchers from over the world to present 
the result of their research activities in the field of Computer 
Science, Engineering and Information Technology. ICIA2014 provides 
opportunities for the delegates to share the knowledge, ideas, 
innovations and problem solving techniques. Submitted papers will be 
reviewed by the technical program committee of the conference.

KEYWORDS: Informatics, E-Learning, Information Ethics, Information 
Content Security, Anti-cyberterrorism, Real-Time Systems and many 


SUBMISSION DATES: Open until September 26, 2014

CONTACT EMAIL: icia2014 <at>
Nick Wedd | 21 Sep 10:44 2014

Congratulations to Zen!

Congratulations to Zen19S, winner of this week's "slow" bot
tournament!  It won all its games, despite suspected hardware
problems causing its operator Hideki Kato to progressively
remove computers from the network running it, as the tournament proceeded.

The results are at
and as usual I welcome your corrections and comments.

Hideki Kato has emailed me, saying that in his opinion four hours
each is too long, and he would prefer future bot tournaments to
have time limits not exceeding one or two hours. I would like
to know the opinions of other bot operators.


Nick Wedd
nick <at>
"Ingo Althöfer" | 13 Sep 11:44 2014

codecentric challenge - blog

Hi all,

in October a best-of-5 match will be played between top
German player Franz-Josef Dickhut (6-dan amateur) and
Remi Coulom's CrazyStone. The special thing is that there
will be no handicaps. (a small german softmare company) is sponsor
of the event. The have one strong player in their team
(Dr. Raymond Georg Snatzke, 3-dan) who is also running a
blog for the event:

The blog texts exist both in German and in English.
There will be only one column for comments which may
be in any langugage (most feedback you will likely get when
writing in English or German).

Cheers, Ingo.

PS. Georg was my assistant at Jena University from Fall 2000
until 2005. In his doctoral dissertation he has investigated
Combinatorial Game Theory for the modern classic game of Amazons.