confocaloid wrote: November 23rd, 2024, 7:51 pmCode: Select all
[1, 4, 20, 68, 162, 248, 256, 144, 51, 0]
wwei47 wrote: November 23rd, 2024, 8:04 pmThank you for that: now I know that my missing neighborhoods are happening somewhere in 4x.
If it helps, here are the counts separately for every ordered pair
(o, d) where
o is the number of nonzero orthogonal neighbours and
d is the number of nonzero diagonal neighbours (the output formatted manually to add newlines and whitespace):
Code: Select all
>>>> [ len(set(canon(t) for t in it.product(range(3), repeat=8) if nnz2(t) == m)) for m in it.product(range(5), repeat=2) ]
[1, 2, 6, 6, 6,
2, 8, 28, 32, 20,
6, 28, 86, 104, 64,
6, 32, 104, 128, 72,
6, 20, 64, 72, 51]
>>>> sum(_)
954
>>>>
Here are the counts separately for every ordered pair
(n1, n2) where
n1 is the number of state-1 neighbours and
n2 is the number of state-2 neighbours:
Code: Select all
>>>> [ len(set(canon(t) for t in it.product(range(3), repeat=8) if nnz3(t) == m)) for m in it.product(range(9), repeat=2) ]
[ 1, 2, 6, 10, 13, 10, 6, 2, 1,
2, 8, 24, 38, 38, 24, 8, 2, 0,
6, 24, 60, 76, 60, 24, 6, 0, 0,
10, 38, 76, 76, 38, 10, 0, 0, 0,
13, 38, 60, 38, 13, 0, 0, 0, 0,
10, 24, 24, 10, 0, 0, 0, 0, 0,
6, 8, 6, 0, 0, 0, 0, 0, 0,
2, 2, 0, 0, 0, 0, 0, 0, 0,
1, 0, 0, 0, 0, 0, 0, 0, 0 ]
>>>> sum(_)
954
>>>>