The (0.143n)^n leaves out some smaller order factors that would help to give more accurate results. The situation is very similar to the number of legal Go posi

The (0.143n)^n leaves out some smaller order factors that would help to give more accurate results. The situation is very similar to the number of legal Go positions on an nxn board [1], which Theorem 6 in that paper states as L(m, n) ~ A * B^{m+n} * L^{mn(1 + O(mφm))} [1] https://tromp.github.io/go/gostate.pdf https://tromp.github.io/go/gostate.pdf