,000 games in there, probably the majority of which are
> between SDK/DDK players (there should be rank info in the SGFs themselves if
> you want to filter that).
>
> Cheers!
> -Adrian
>
>
> On Tue, Nov 26, 2013 at 4:18 PM, Arthur Cater wrote:
> For machine learning e
For machine learning experiments I'd like to locate thousands of sgfs of games
between non-experts, to contrast with those of experts as found on GoGoD.
Can anyone advise how I might get my hands on such?
Arthur
___
Computer-go mailing list
Computer-go
My thanks to Harald Johnsen, David Fotland, and Petr Baudis
for very helpful (and very speedy) replies.
Arthur
On 12 Jun 2011, at 17:34, Arthur Cater wrote:
I cannot remember who/what I read that mentioned a "gridcircular"
measure of
distance - contrasting with Euclidean and Manhat
I cannot remember who/what I read that mentioned a "gridcircular"
measure of
distance - contrasting with Euclidean and Manhattan. It is something
like
max(Hseparation,Vseparation) + ( 1/2 * min(Hseparation,Vseparation) )
If anybody can help, with claiming it, or naming its inventor, or
espe
I confess I did not think of the existence of correlations. I simply
thought 1.2% was quite low,
wondered how that could be, and marvelled at how close this simple
calculation came to
that result. My feathers may deserve some ruffling - but I remain
obstinately mellow! Anyway,
fwiw, it was my
Intriguing!
A position is obviously illegal if any point is occupied by a stone
surrounded by opposite-colour stones.
At the 4 corners, 25 out of 27 combinations will be legal. The
proportion (25/27)^4 will survive.
At the 68 edges, 79 out of 81: (79/81)^68 will survive.
At the 289 interior
To my mind, it becomes useful when the distances are much larger,
when thresholded with an exclusive odd-number upper limit it
generates dodecagons,
which pleasingly approximate circles.
Arthur
On Jun 18, 2010, at 12:53 PM, Petr Baudis wrote:
On Fri, Jun 18, 2010 at 08:45:14PM +0900, Darre
Thanks, that is where I saw it recently. However I don't see the name
"gridcircular" used.
Also, the diagram on p51 has strange numbering: centre point is 1,
going out along axes we see 1,2,4,6,9,11,13 - only the 2,4,6 make
sense to me.
Arthur
On Jun 18, 2010, at 11:48 AM, Petr Baudis wrote
Is there a formal name for this distance metric?
distance=C.(dx+dy+max(dx,dy))
where C may be 1 or 1/2 , it doesn't much matter.
And in which well-known Go program(s) is it used? I'm sure I've seen
something
about it recently but damned if I can find it again.
Help much appreciated.
