GO sequence

[y.kohmoto]

    Neil
    The word "The longest" must be added on Name line.

    %N A096259 The longest period of an abstract version of the game of Go
on a 1 X n board.

    Comment :

    The reason why it is "abstract".
    Neither rule 1 nor rule 2 doesn't define the  state of win. So, it never
ends.


    The shortest period is not so interesting.
    S : 1, 2, 1, 1, 1, 1, 1, 1, 1, 1....
    Only S(2) is 2, and the others are all 1.

    n=2 :
    +  o  +  o  +
    +  +  x  +  x

    period=2, it is the same as "Ko" in real GO game.

    In cases 2<n, it is possible to make a state of win, even though it is
not defined.

    n=4 :
    +  o  +  +  +
    +  +  x  x  x
    +  +  +  o  +
    +  +  +  +  x

    the last column has two empty nodes, it is called " two eyes" which is a
typical configuration of win. It doesn't change  , so period =1.

    Yasutoshi