|
%I #11 Nov 11 2018 23:11:27
%S 1,1,386356909593
%N Number of Go games on n X n board with no repeating position and suicide allowed.
%C I only chose starting offset 0 because the number of 3 X 3 games is unknown (and over a thousand digits).
%C a(n) is also the number of simple paths in the Go game graph starting at the empty position.
%C a(n) is upper bounded by n^{2*3^{n^2}}, as shown in Theorem 7 from the linked paper.
%H J. Tromp and G. Farnebäck, <a href="http://dx.doi.org/10.1007/978-3-540-75538-8_8">Combinatorics of Go</a>, Lecture Notes in Computer Science, 4630, 84-99, 2007.
%e a(1) = 1 since the only legal Go game on a 1 X 1 board is Black pass, White pass.
%Y Cf. A094777.
%K nonn,more,bref,hard
%O 0,3
%A _John Tromp_, Feb 25 2016
|
