A048289 Number of Go games with exactly n moves.

1, 361, 129960

Offset

0,2

Comments

The sequence seems based on the assumption that the game starts with an empty 19 X 19 board, which is not necessarily the case in an official Go tournament. After any of the 361 = 19^2 choices for the first move, the opponent has 19^2-1 choices for placing his stone, so the value a(2) = 361^2 = 361*(361-1 + 1) takes into account the possibility of not placing a stone. A detailed account of the precise rules used here would be useful to make the definition of this sequence complete. - M. F. Hasler, Nov 22 2016

This sequence counts distinct Go board positions after n moves, excluding terminated games. Positions are considered identical if stones and turn-to-play match, regardless of move history. (To be discussed!) Passing moves are omitted from non-terminal states, as early passes are exceptionally rare in practical play.

Links

Table of n, a(n) for n=0..2.

Daniel Forgues, Game of Go, OEIS wiki, Feb. 2016.

Crossrefs

Cf. A007565.

Sequence in context: A231770 A145121 A062788 * A191216 A337729 A013765

Adjacent sequences: A048286 A048287 A048288 * A048290 A048291 A048292

Keyword

nonn,nice,hard,more,fini

Author

N. J. A. Sloane

Status

approved