Don Dailey wrote:
>Your odds of finding a "winning move against a pro
>player" is different from finding one of the "best
>move(s)" in the position, ...
I agree. I was oversimplifying. It would be more
appropriate to say: Except, probably for the first
moves (as you point correctly, where the nu
On Sun, 2006-12-31 at 13:00 +, Jacques Basaldúa wrote:
> I don't agree on that. If you are used to Chinese
> and watch a Japanese game, you won't see any kind
> of silly moves (assuming they are not silly to a
> Japanese observer).
That's not true. The Chinese player (who has never
heard of
People who play by Japanese rules fill the dame before passing and scoring.
Professional game records leave those moves out since they are irrelevant,
but if you go to a club and watch people playing, they usually fill the dame
before passing. Sometimes you will see a verbal agreement that the gam
For testing Suzie on 9x9 we (Peter Woitke and Chrilly) use Gnu-Go Level 16.
Is there something stronger around /available?
Chrilly
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
I disagree that in Chinese rules a player can afford to play
unnecessary defensive moves inside his territory. If you play an
unneccessary move inside your territory while there are still dame
points, you will lose points under Chinese rules, because your move
has no value, but your opponent wi
What is the strongest program on CGOS that does pure monte-carlo without
UCT? By pure monte carlo, I mean a single ply search with monte carlo as the
evaluation, and scaling by doing more simulations per evaluation?
It looks to me that the strength of the top programs, like Mogo, is mostly
due to
Hello,
> It looks to me that the strength of the top programs, like Mogo, is mostly
> due to the new UCT search algorithm.
It depends what you compare to.
If you compare UCT against no tree, this makes a lot of difference.
If you compare UCT to former Remi Coulom's tree search algorithm, Remi ca
I see. It seems that most of Mogo's strength is due to using pattern
sequences in the Monte Carlo random games.
I have some questions about your paper...
I thought that the Monte Carlo evaluation of a position is done by making
many random games from that position, and averaging the win/loss res
On 1/1/07, David Fotland <[EMAIL PROTECTED]> wrote:
In your paper you show win rates against GnuGo of about 50%, depending on
the parameters. The current Mogo beats GnuGo over 90%. What
changed? Are
you doing more simulations, or do you have more go knowledge in your
patterns? Does Mogo have
Hello,
I´m playing with MC-UCT and patterns in MC "random" simulation.
On Sunday 31 December 2006 23:02, David Fotland wrote:
> I see. It seems that most of Mogo's strength is due to using pattern
> sequences in the Monte Carlo random games.
My MC engine got a lot better when I modified the "ra
10 matches
Mail list logo
