On 2/21/07, Brian Slesinsky [EMAIL PROTECTED] wrote:
[resending; apologies if you get this twice.]
Hi,
Hi Brian,
This is my first post to the list, so I'll introduce myself: I'm a
software developer and just getting started with playing Go. I read
the article in the Economist and
Le mercredi 21 février 2007 02:10, Antonin Lucas a écrit :
No need for those difficulties, you can play along this board :
http://www.youdzone.com/go.html
I think this is not a torus, even if each vertice has 4 neighbours.
I can easily mentally transform this into a cylinder, with an
David Doshay wrote (on behalf of the 3x3 block of pixels
applied repeatedly):
But if done all the way to just one pixel it will show the winner.
Shouldn't that require some kind of error propagation? In dithering
techniques, you count the error produced, because it is not the same
to count
Thank you for your answer. However, I am even more confused now. I understand
that - is for negamax, but I don't understand why it became 1-. I am trying
to implement your algorithm and I just want to know what lines 7, 16 and 26
should be?
-Original Message-
From: Sylvain Gelly
If Black is the first player then why is he winning so little? If you are not
using komi then Black should win more often then White. If you are using komi
then the percentages should be more or less even, i.e. 50%-50%. Am I missing
something?
___
Thank you for your answer. However, I am even more confused now. I
understand that - is for negamax, but I don't understand why it became
1-. I am trying to implement your algorithm and I just want to know what
lines 7, 16 and 26 should be?
It became a 1- because I said a mistake while
Sorry, my mind jumped to the physics, and I should have said
in the limit of an infinite board.
Cheers,
David
On 21, Feb 2007, at 2:43 AM, Jacques Basaldúa wrote:
David Doshay wrote (on behalf of the 3x3 block of pixels applied
repeatedly):
But if done all the way to just one pixel it
Hi Chris,
Again, thanks for the work. But again, I need to ask for a small
change to see what I am looking for.
Can you please replace each 3x3 block of pixels with a single
pixel? My mind can't do the transformation visually. I really do
want each lattice to be smaller than the previous, but
The only real change is to link against the Boost libraries I
installed using DarwinPorts. Here are the diffs:
-CFLAGS += -Wall #-static #-Wno-long-long -Wextra -Wno-variadic-macros
+CFLAGS += -Wall -I/opt/local/include -L/opt/local/lib
It's a desktop and I don't see any options for power
On Wed, 2007-02-21 at 16:56 +0300, Dmitry Kamenetsky wrote:
Thank you for your answer. However, I am even more confused now. I
understand that - is for negamax, but I don't understand why it
became 1-. I am trying to implement your algorithm and I just want
to know what lines 7, 16 and 26
That board needs to have the inside edge be connected to its outside
edge, in order to represent a torus.
Weston
On 2/20/07, Antonin Lucas [EMAIL PROTECTED] wrote:
No need for those difficulties, you can play along this board :
http://www.youdzone.com/go.html
On 2/21/07, Weston Markham
(oops. Other people have already pointed this out, in an
appropriately re-named thread.)
On 2/21/07, Weston Markham [EMAIL PROTECTED] wrote:
That board needs to have the inside edge be connected to its outside
edge, in order to represent a torus.
Weston
A gross simplification, but most news articles are ...
http://news.yahoo.com/s/nm/20070221/tc_nm/science_go_dc_2
Cheers,
David
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
Doshay [EMAIL PROTECTED] wrote:
A gross simplification, but most news articles are
...
http://news.yahoo.com/s/nm/20070221/tc_nm/science_go_dc_2
Cheers,
David
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer
: [computer-go] UCT article
A gross simplification, but most news articles are ...
http://news.yahoo.com/s/nm/20070221/tc_nm/science_go_dc_2
Cheers,
David
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo
Marbles are always spherical. Playing Go with marbles is comical.
On 2/21/07, Sylvain Gelly [EMAIL PROTECTED] wrote:
my favorite line:
In Go all marbles are identical...
My English prevent me to understand the subtlety here.
Is there any relation to the type of stone meaning of marble?
It's funny to English-speakers because when we think of marbles, we're
thinking of something like this
http://www.atoygarden.com/images/products/Marbles300.jpg
Some games are played with marbles, but since in English the go pieces are
called stones the concept of playing Go with marbles evokes
Sylvain Gelly wrote:
my favorite line:
In Go all marbles are identical...
My English prevent me to understand the subtlety here.
Is there any relation to the type of stone meaning of marble?
No, not really.
Here the meaning of marbles is that of children's toys, small
spherical
There is also the expression, He isn't playing with all his marbles!
I don't think the author did this by accident, instead I think he liked
the sound of it. It's common for writers to take liberties like this to
jazz up an article.
- Don
On Wed, 2007-02-21 at 14:01 -0800, Thomas Johnson
Thank you all for your precise answers!
Sylvain
p.s. the find out more link at the bottom of your page
http://www.inria.fr/futurs/ressources-1/computer-culture/mogo-champion-program-for-go-games
is pointing to the wrong place, isn't it?
What do you mean? You mean you can't access the
On Wednesday 21 February 2007, Chris Fant wrote:
It seems that GtpStatistics (java tool that comes in the GoGui
package) is not sending a quit command to my gtp player. This results
in me having to manually kill the gtp player process after each run.
please report GoGui bugs to the GoGui bug
Can you please replace each 3x3 block of pixels with a single
pixel? My mind can't do the transformation visually. I really do
want each lattice to be smaller than the previous, but at the
same pixel scale.
What I am looking for is how much the renormalized lattice looks
like a piece of the
On 21, Feb 2007, at 4:41 PM, Chris Fant wrote:
Can you please replace each 3x3 block of pixels with a single
pixel? My mind can't do the transformation visually. I really do
want each lattice to be smaller than the previous, but at the
same pixel scale.
What I am looking for is how much the
It is pretty clear to me that, if the analogy to MC simulations in
magnets
is of any value, the temperature of the Go game you show is hotter than
optimal.
If the temperature were at the transition temperature, then each of the
renormalized lattices would look just like a piece that size cut
Stuart A. Yeates wrote:
On 2/21/07, alain Baeckeroot [EMAIL PROTECTED] wrote:
Le mercredi 21 février 2007 02:10, Antonin Lucas a écrit:
No need for those difficulties, you can play along this board :
http://www.youdzone.com/go.html
I think this is not a torus, even if each vertice has 4
I have seen such a board for sale online. I would have to search to
find it again.
Cheers,
David
On 21, Feb 2007, at 9:29 PM, Nick Apperson wrote:
I considered making a version of go that plays with tetrahedral
geometry. It is a 3D arrangment where all nodes have 4 neighbors
and the
ah I see. I ran some tests and here is what I got:
Komi=7.5
P(Black wins)=41.4%
Komi=6.5
P(Black wins)=44.5%
Komi=5.5
P(Black wins)=44.1%
Komi=4.5
P(Black wins)=46.7%
Komi=3.5
P(Black wins)=47.0%
Komi=2.5
P(Black wins)=49.7%
Komi=2.0
P(Black wins)=49.7%
Komi=1.5
P(Black wins)=49.6%
27 matches
Mail list logo
