Life In 19x19

Knotwilg wrote:

zorq wrote: Unfortunately, nothing in that note is correct.

At least it's imprecise.

Not imprecise. It is total rubbish. It shows that this famous powerful mathematician has lost his mental faculties.

EdLee wrote:Tiny typo on page 2. ( Surely completely innocuous.)

Unfortunately, nothing in that note is correct.

anpd wrote:Hi anyone know of an easy way to swap colors of a sgf file? It's for tsumego files.

Try sgftf.

Jnkstry wrote:Which Software are you guys using to search through the games?

In a Linux environment the command-line utility sgfinfo allows you to search on name, date, handicap, board size, B/W pattern, specific moves, signature, etc., and arbitrary combinations of these.

In general one maximizes the probability of winning by maximizing the territory difference.
This is clearly false. If one is greedy, one may be punished.
Many of the plays that these programs make when ahead do not appear to be playing safe, they look silly, particularly in the endgame.
They ...

yamiyodare wrote:AlphaGo selects one way with 100% win rate

I don't think so. As far as I can see, AlphaGo does not include a theorem prover, while the number of legal variations is astronical, also in the end game. So, not all legal variations are investigated, and a win is never certain, only very likely.

drmwc wrote:What is the asymptotic distribution of P(n) as n gets large?

See arXiv:1507.03805

This is the only pairing plan for four players. There is also only pairing plan for six player round robin. How many different pairing plans there are for eight player round robin? I think you are asking for the number of 1-factorizations of the complete graph (up to isomorphism).
There are six ...

The sgf contains a 'CoPyright' property that WGo cannot parse. So the problem is not in your code. I suppose it's not even in WGo's code as property in SGF must be 2 uppercase letters (m) so the correct value must be just 'CP' in this case...

One should not assume that SGF is necessarily FF[4 ...

I dont quite understand the solution in the last post. So here my try.
Next it would be interesting to understand how the computer establishes this theorem. Probably hypergeometrical series are the key.
Zeilberger-Wilf theory provides automatic summation methods for such identities, so ...

Bonobo wrote:And for clickability … here: http://321go.org/home/

That page promises 2000 go problems, but no link is given.
Perhaps these problems are hidden behind username+password?
That would be a pity.

...
C(n,k) is the number of ways one can choose k things from a set of n things.
The left hand side is the number of ways one can pick at most s-1 things from a set of n.
Put your things in a row, and look at any of these choices. Let k be minimal such that this choice contains s-k from the first ...

Does anyone here know of a SGF collection management tool similar to Jacoto or StoneBase?
I'm not looking for pattern searching, just a nice grid view, and text search.
If it runs on Linux would be better, but is not required.

sgfutils will give you text search and pattern search and more, on ...

RapaNui, CGoban3 saves the timestamps in the SGF and displays them when you replay the game.
Is there a standard? What format do RapaNui, CGoban3 use? I see DT[..] fields such as

2013-08-13 22:31 - 2013-08-13 22:53,
Fri Oct 11 20:59:58 GMT+08:00 2002
2010071315:25
1995/07/08 23:55:23 UT
20100222 ...

Numsgil wrote:So far I've found sgfutils. It's aimed at linux, and I'm a windows man, but I was able to get it to compile for windows with some fiddling. ... It's managed to blow the command line limit in windows for a few test games I tried doing...

Does the -maxcommandsz option help?