Hi all,
after quite some years I eventually completed my PhD. As the thesis is
too large to be accepted as attachment by this list, please find my
thesis for download here (until I find a proper place for hosting it):
https://www.dropbox.com/s/x0lh7ky5lvj6c1y/PhdThesisSchaefers.pdf
Perhaps some
I don't think it is wrong. I do think it is inadvisable. You are
trusting the server's score-counter to count in the way that you
expect, when there are dead groups on the board and it can reasonably
assume that there are no dead groups on the board.
For instance, in the position shown,
: The described heuristic is yet not used in our productive
version of Gomorra. Its application to improve the MCTS search process
is still research in progress.
Cheers,
Lars
On 09.10.2013 15:30, Lars Schäfers wrote:
On Semeai Detection in Monte-Carlo Go
In this paper, does semeai stand for one
Hi,
partly as a result of the discussion in the thread Zen resignation
positions, we wrote the following paper on the detection of semeai
during MCTS:
On Semeai Detection in Monte-Carlo Go
Abstract:
A frequently mentioned limitation of Monte-Carlo Tree Search (MCTS)
based Go programs is their
Nice to see somebody working on accelerator hardware for Go (again).
There actually were some attempts in the past and even publications that
might be interesting for you [1][2].
I think in principle you have two possible directions when looking at
accelerating basic MCTS for Go:
a) Accelerating
This is a bit off topic (sorry), but might be of interest for some of
you. I'll keep it short..
A colleague of mine and his brother just started a crowdfunding project
on indiegogo with the goal to collect some money for the production of a
Go promotion video. In case of interest have a look
Thank you Simon for pointing to our paper.
I just would like to send you the link below to the actual camera ready
version of our paper (as it was published) with some modifications
related to comments from the reviewers and some feedback kindly provided
by Rémi Coulom and Ruby Chiu-Hsing Weng:
Hi Alexander,
for the reasons you mentioned I trained my pattern system on games
between weaker and stronger players some years back. That was for 9x9
board size where I used game records from cgos where both players had a
strength of at least 1700 Elo and at least one player was stronger than
Nick,
thank you for your report and the organization of the tournament!
About round 11 you wrote:
In round 11, MCark did not move in its game with gomorra3 until its
operator restarted it, after an hour.
In fact it was gomorra32 that didn't made its first move because cluster
resources expired.
Hi Petr,
I'll be most likely there. And of course, a less official tournament
and/or an evening chat would be great. So, who else will be there?
I'm looking forward to seeing you again!
Lars
On Wed, 2012-01-18 at 23:03 +, Petr Baudis wrote:
Hi!
On Wed, Jan 18, 2012 at 08:04:24PM
Hi Jouni and Ingo,
Ingo reminded me of your prize and we, the Gomorra-Team, are actually
thinking about it. Gomorra is able to run on compute clusters and
recently we made some more progress with our parallelization. It allowed
us to come out second in the last two KGS tournaments. For fairness I
Congratulations to Steenvreter!
Thank you Nick once again for the organization of the tournament and the
report!
Gomorra was running on 8 nodes with 12 cores each this time. Sorry Nick,
I forgot to give you this information in the registration mail.
Also, in the Details of processor.. section
Hi,
for those of you interested in parallel MCTS for distributed memory
machines, I want to point you to our paper Parallel Monte-Carlo Tree
Search for HPC Systems recently presented at the EuroPar 2011
conference.
We present a novel approach for the parallelization of MCTS which allows
for an
On Wed, 2011-02-09 at 22:48 -0800, David Doshay wrote:
I agree that any TD should be able to give this kind of advice for
tournaments
like these.
Me too. I think we all want to win on the board and not on wrong
configuration files of our opponents or comparable things..
I welcome every help
BTW Lars, please give me your phone number so that I can call you up when
Gomorra has any trouble. :)
I'm a bit scared it may end up in something comparable to telephone
terrorism :)
- Lars
___
Computer-go mailing list
Computer-go@dvandva.org
Hi Magnus,
kaesebrot is german for cheese-bread and was a test version of Gomorra.
It has an adaptive opening book and makes a lot of computations after
every lost game. Thats why it disappeared after every lost game for a
while. So not a new program.
Valkyria is constantly doing very well. Also
Hi Łukasz
On Wed, Aug 18, 2010 at 09:23:30AM -0700, Peter Drake wrote:
Łukasz:
I haven't used Libego directly, but I did take some inspiration from
it in building the core routines for Orego.
Same for Pachi. I did not copy or directly transcribe any concrete
code, but libego
Arthur,
you probably saw it in this paper of Remi Coulom:
http://remi.coulom.free.fr/Amsterdam2007/MMGoPatterns.pdf
It is used to define diamond shaped patterns there.
Best wishes,
Lars
On Fri, 2010-06-18 at 09:28 +0100, Arthur Cater wrote:
Is there a formal name for this distance metric?
Nick,
There are copy-paste errors in the Details of processor numbers..
section:
- A typo in gomorra9 (gommorra9).
- Gomorra ran with 8 threads on two Core i7 CPUs (not using
hyperthreading).
Thank you for organizing the tournament!!
- Lars
On Mon, 2010-05-03 at 20:12 +0100, Nick Wedd wrote:
19 matches
Mail list logo
