We used Python to see that the determinants of the association matrices are powers of 2 alternating from positive to negative interleaved by 0s once the size of the triangle is greater than 4. (When the side length was 3, the pattern was disrupted.)
Triangles in a triangle arrangement with the neighborhood defined by edges and not counting self.
Using Python, we discovered that the determinants were always 0, meaning that all of them should be unsolvable.
The number of the bottom row of the triangle is: 01010...10. This can be solved as either XOOOXOOO... or OOXOOOX...
Matrices (where n is the side length):
n=1: [0]
n=2:
0 0 1 0
0 0 1 0
1 1 0 1
0 0 1 0
n=3:
0 0 1 0 0 0 0 0 0
0 0 1 0 0 1 0 0 0
1 1 0 1 0 0 0 0 0
0 0 1 0 0 0 0 1 0
0 0 0 0 0 1 0 0 0
0 1 0 0 1 0 1 0 0
0 0 0 0 0 1 0 1 0
0 0 0 1 0 0 1 0 1
0 0 0 0 0 0 0 1 0
....





