David Doshay wrote:
> Two
separate rating tables were kept, one for handicap games and another for
non-handicap games. Over time it turned out that the ratings for
individuals converged
Did they converge for each person individually or converge only for all
persons on average? Did the converg
No game have started for half an hour, so it seems to have a problem.
And if some other people want to play on 13x13 don't be afraid, my bot
will be happy to play with yours.
Tom
--
Thomas Lavergne"Entia non sunt multiplicanda praeter
nec
Thanks for resstarting and putting CS in the pool.
I'm verry impressed by CS (is it CrazyStone like I think ?) It play
extremly quickly (finish the game without having consumed time...) and
very well.
It's too much for my poor bot... but it's good for me, there is plenty
of rooms for improvements
On Thu, 2008-09-04 at 18:07 +0200, Rémi Coulom wrote:
> When the playouts evaluate a critical semeai the wrong way, then no
> supercomputer can help, even at long time control. Semeais require a
> better algorithm, because no computing power can search them out with
> a
> tree, and playouts have
I will also run Valkyria on CGOS 13x13 over the weekend, (or long as
things are stable).
--
Magnus Persson
Berlin, Germany
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
> On Thu, 2008-09-04 at 18:07 +0200, Rémi Coulom wrote:
> > When the playouts evaluate a critical semeai the wrong way, then no
> > supercomputer can help, even at long time control. Semeais require a
> > better algorithm, because no computing power can search them out with
> > a
> > tree, and p
On Sep 5, 2008, at 7:49 AM, terry mcintyre wrote:
19x19 differs from 9x9 in that it can be more readily partitioned;
in smaller boards, everything often closely interacts with
everything else.
I have also found this to be true. I tried various ideas relating to
"finding the important area
terry mcintyre wrote:
Has anyone tried implementing the ideas in Richard Hunter's "Counting
> Liberties"
My so far private theoretical study beyond his ideas has revealed the
following:
- He overlooks some details like exceptional cases and liberty counts
for approach defects. (And he does no
Has anyone tried heavy, slow playouts near the tree and light, fast playouts near the end of the game? I'm calling this "playout acceleration" because it
starts slow and speeds up. You could have many different playout weights/speeds in a single playout. It seems like a reasonable idea to me si
On Sep 5, 2008, at 10:34 AM, Robert Jasiek wrote:
terry mcintyre wrote:
Has anyone tried implementing the ideas in Richard Hunter's "Counting
> Liberties"
...
So although Hunter's study is a good fundament from which to start
working (in expert systems or for becoming a stronger player),
There is this:
http://webdisk.lclark.edu/drake/publications/GAMEON-07-drake.pdf
The idea of gradual acceleration is intriguing, although I shudder to
think of setting the parameters for such a process.
Peter Drake
http://www.lclark.edu/~drake/
On Sep 5, 2008, at 10:43 AM, Michael William
You would have to ask these questions of Paul. He is an extremely
serious and careful person, so while I would find it hard to believe
that every person had exactly the same rating down to 0.01, it must
have been very close when the entire collection of AGA members was
considered. I do not
> From: Bob Hearn <[EMAIL PROTECTED]>
>
> On Sep 5, 2008, at 10:34 AM, Robert Jasiek wrote:
>
> > terry mcintyre wrote:
> >> Has anyone tried implementing the ideas in Richard Hunter's "Counting
> > > Liberties"
> >
> > ...
> >
> > So although Hunter's study is a good fundament from which to st
Bob Hearn wrote:
But conceivably, it is not necessary to completely analyze semeai
statically, merely to produce some better heuristics so that the
playouts do a better job with semeai, correct?
In principle, right. I'd guess, things would be different during middle
game in an expert system a
There might be no need for heavier playouts to be slower.
Sometimes they are even faster. (maybe it was in case of Crazy Stone?)
On Fri, Sep 5, 2008 at 18:43, Michael Williams
<[EMAIL PROTECTED]> wrote:
> Has anyone tried heavy, slow playouts near the tree and light, fast playouts
> near the end
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.
Christoph
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.or
Yes, I tried heavy playouts for N plys, then switching to light.?It didn't
really speed things up all that much but it weakened my bot quite a bit, on a
per playout basis, resulting in a clear net loss.
?
I tried ladder reading for the first N plys, then no ladder reading. The
results were muddl
MoGo and Myungwan Kim will hold an exhibition rematch at the Cotsen
Open on Saturday September 20. The exhibition will start at about 5pm
Pacific Daylight time.
As probably known by all on this list, MoGo won the last game, held at
the US Go Congress in Portland Oregon, when it was given a
Great news! Look forward to seeing it happen. I hope Mogo has some
great hardware.
- Don
On Fri, 2008-09-05 at 15:54 -0700, David Doshay wrote:
> MoGo and Myungwan Kim will hold an exhibition rematch at the Cotsen
> Open on Saturday September 20. The exhibition will start at about 5pm
> P
Cgos game archives have been updated so we now have all of August's
games.
- Don
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
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
>
>_
Has anyone applied the ideas in "Modelling Uncertainty in the Game of Go" by
Stern, Graepel, and MacKay?The paper can be found at:
http://research.microsoft.com/~dstern/papers/sterngraepelmackay04.pdf
It was quite a fascinating paper!
- George
___
comput
22 matches
Mail list logo
