

A269417


Number of Go games on n X n board with no repeating position and suicide allowed.


1




OFFSET

0,3


COMMENTS

I only chose starting offset 0 because the number of 3 X 3 games is unknown (and over a thousand digits).
a(n) is also the number of simple paths in the Go game graph starting at the empty position.
a(n) is upper bounded by n^{2*3^{n^2}}, as shown in Theorem 7 from the linked paper.


LINKS

J. Tromp and G. Farnebäck, Combinatorics of Go, Lecture Notes in Computer Science, 4630, 8499, 2007.


EXAMPLE

a(1) = 1 since the only legal Go game on a 1 X 1 board is Black pass, White pass.


CROSSREFS



KEYWORD

nonn,more,bref,hard


AUTHOR



STATUS

approved



