1D Go is also interesting and doesn't require any change in rules or starting position. TIL that it is known as Alak [1]. One of the open problems in our Combinatorics of Go paper [2] is whether you can play a game that goes through all possible legal 1xn positions for any n>2, which we were only able to verify up to n=7.

[1] https://senseis.xmp.net/?Alak

[2] https://tromp.github.io/go/gostate.pdf