After the conference, will the papers presented be publicly available?
On 12/3/07, Martin Mueller [EMAIL PROTECTED] wrote:
I forward this call for papers since it may be of interest to some of
you.
Martin
Call for Papers:
On Sun, 2 Dec 2007, Russell Wallace wrote:
I haven't seen Leela before, but the claim of high dan-level
performance on 9x9 is certainly interesting.
I don't think 2200 ELO on the 9x9 CGOS is equivalent to 'high dan-level'
play.
Christoph
___
David Doshay wrote:
On 22, Nov 2007, at 9:35 AM, Don Dailey wrote:
This is one of many things in life that people refuse to believe -
regardless of the evidence. ...
Instead, people focused on highly selective searches. In order to
play strong it was clear that computers would have to
Yes, in its present instantiation, SlugGo is inadmissibly selective.
In this case, we clearly see that after some small number, more
plies of global search result in worse play.
I do not have any expectation of perfect play, only improvement
over the present state of things.
Cheers,
David
On
In message [EMAIL PROTECTED], Ian
Osgood [EMAIL PROTECTED] writes
According to computer-go.info, today CrazyStone won both sections of
the KGS tournament (against strong opposition this month) and the UEC
Cup in Japan.
Well done, Rémi!
Here is my report on the KGS event:
There is something that the latest Monte Carlo programs have in common
with the best chess programs - and seems to be the right way to
structure a game tree search.Your selectivity should be
progressive. In order to do this correctly you must re-visit nodes
many times. Chess programs
