Thanks, I though so, but I just wanted to make sure. So all numbers in this sequence must be odd because of color symmetry + 1 for the empty board.
I was wondering if there is an efficient way to find the number of unique positions with symmetrical positions excluded. Erik On Fri, Jan 22, 2016 at 4:45 PM, John Tromp <john.tr...@gmail.com> wrote: > dear Erik, > > > Does the number include symmetrical positions (rotations / mirroring / > color > > reversal)? > > Yes, of course. > This is also apparent from the table at the bottom listing 57 legal > 2x2 positions. Figure 4 on page 5 of our paper > http://tromp.github.io/go/gostate.pdf > shows how these 57 positions form 13 equivalence classes with respect > to mirroring/reflection which further reduces to 7 classes when > considering color symmetry as well. > > regards, > -John > _______________________________________________ > Computer-go mailing list > Computer-go@computer-go.org > http://computer-go.org/mailman/listinfo/computer-go >
_______________________________________________ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go
