I would first just like to say, there have been many times in my life where
I have known 1000 times more than someone else and I didn't feel the need to
be an ass. I'm sure you are a nice person, but please don't treat me like I
am a moron. Some assumptions you made about me that aren't true:
Hello,
It looks like most of these games are being won in the opening. Doesn't
mogo have a big UCT opening book? Is it learning from each game it plays
as
well?
unfortunately no for both. Its opening book is at maximum 4 ply (deepest
variation) and if you play first on a yoshi it is 2 ply
Le vendredi 12 janvier 2007 23:45, Chrilly a écrit :
It would be interesting if the empirical Komi depends on the playing
strength.
It seems that for nearly random players, the komi is close to 0 (or maybe 1
under chinese rules to compensate for 1 more stone)
Gunnar reported komi = 0.05 for
Le mercredi 10 janvier 2007 10:32, Sylvain Gelly a écrit :
Hello,
Also on 19x19 mogos plays also some very slow moves in the beginning of
7 handicap game.
[...]
In 19x19, MoGo only considers local moves, near the move you
just played or the last move it played. It even doesn't look at
I did not try something like plays globally until the xxx move then
locally. Perhaps it should help.
Hmm its probably rather difficult to find the balance, local answer are
very often needed. Good stuff would be : when no local answer is needed,
then take initiative and play one big/global
On Fri, 2007-01-12 at 15:51 +, Mehdi Ahmadi wrote:
Hello thank in advance for any interests/ responses.
I'm unfortunately (or not) doing a dissertation as part of my final year
project (undergraduate) on the game of Go. The exact title is: Can the game
of go be solved? Analysis of
Ok Nick,
The funny thing about this, is that I was originally defending someone
who
after making a simple post got flooded with all the stale size of the
universe
and grains of sands arguments - presumably to prove he was wrong when he
made
a simple statement which was correct. He made the
It seems that you GTP implementation doesn´t implements the
command final_score.
About the passes. I found that pass move is not sent by twogtp.py to the
other player.
So, from a black player point of view, you will receive: genmove black, you
will process and return your move. If you
On Friday 12 January 2007 16:16, Chris Fant wrote:
Seems like a silly title. Any game of perfect information that has a
clear rule set can be solved. Plus, some would argue that any Go
already is solved (write simple algorithm and wait 1 billion years
while it runs). A better question is,
CM-1's processing element is not a transputer but a custom (CMOS) 1-bit
ALU with 4Ki bit of RAM. I know this is not essential but believe this
kind of correction is old men's role :-).
alain Baeckeroot: [EMAIL PROTECTED]:
Le samedi 13 janvier 2007 15:06, Don Dailey a écrit :
If a computer can
Le samedi 13 janvier 2007 16:46, Hideki Kato a écrit :
CM-1's processing element is not a transputer but a custom (CMOS) 1-bit
ALU with 4Ki bit of RAM. I know this is not essential but believe this
kind of correction is old men's role :-).
oops, true, my memory mixed up some old stuff :)
oops, accidentally sent to just Don Dailey
-- Forwarded message --
From: Nick Apperson [EMAIL PROTECTED]
Date: Jan 13, 2007 5:11 PM
Subject: Re: [computer-go] Can Go be solved???... PLEASE help!
To: [EMAIL PROTECTED]
Here is a link for anybody that is interested in why I say 2
On 1/14/07, Nick Apperson [EMAIL PROTECTED] wrote:
From: Nick Apperson [EMAIL PROTECTED]
...
Essentially says that the maximum amount of information is proportional to
the 2D surface around it. Even if we live in a many-dimensional world (I
happen to believe we do), the area surrounding it
13 matches
Mail list logo
