Friday, October 3, 2014

October 3

Triangles in a triangle arrangement with the neighborhood defined by edges and counting self.

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.)

n = 1, det = 1
n = 2, det = -2
n = 3, det = -4
n = 4, det = 4
n = 5, det = 0
n = 6, det = -8
n = 7, det = 0
n = 8, det = 16
...

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 bottom row is the highlighted one:


The number of the bottom row of the triangle is: 01010...10. This can be solved as either XOOOXOOO... or OOXOOOX... with the rest of the triangle being Os. 


[I don't know if it would be easier to think of the bottom row as two different "rows," one of triangles pointing up, one of triangles pointing down. If we did consider them like that, the pattern would be XOXO... and all Os and then OXOX... and then all Os.]

For the sidelength of 1 case, we know that the number will always be 0, because it does not count itself. This is unsolvable because we do not know if the 1 triangle contains an X or an O.

For the sidelength of 2 case, we have:
For the sidelength of 3 case, we have:

For the sidelength of 4 case, we have:

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
....

1 comment:

  1. Minor edit: For the left side of the side-length three diagram, the X's should be in the two bottom corners (one of the X's is in the wrong spot).

    Otherwise, great job documenting the progress on the project.

    ReplyDelete