Conjecture:
If
or
then the m by n grid is unsolvable.
[Also, side note: m refers to column, n refers to row. This is because of the proper alphabetical order and the usual way of referring to things as row then column.]
Examples that I have (some) solutions for.
Numbers: [{1 2 2 ... 2 1}]
XO grids: [{XOXX...OXXO}] and [{OXXO...XXOX}]
2] m x 2:
Numbers: [{2 3 3 ... 3 2}{2 3 3 ... 3 2}]
XO grids: [{XOXO...}{OXOX...}], [{OXOX...}{XOXO...}], [{XXX...}{OOO...}], [{OOO...}{XXX...}]
3] 5 x 3:
Numbers: [{2 3 4 3 2}{3 5 6 5 3}{2 3 4 3 2}]
XO grids: [{XOXXO}{OXOXO}{OXXOX}], [{OXXOX}{OXOXO}{XOXXO}] + possibly others
4] 8x8:
Grids shown below:
A few of these I have after doing the 5 x 3 case, which is why a few are specific to odd ms and ns.
- In the number grid, the numbers increase towards the center, both horizontally and vertically.
- The two solutions are reflections of each other over either the vertical or horizontal axis (so far, I think that both transformations yield the same result, so either gets from one solution to the other)
- The number of solutions pairs (those that are reflections of each other) is related to n, the number of columns. At the moment, I believe it is the number of columns.
- In the case where n and m are odd, the middle row and column will be the same in both solutions. (I'm not sure how this works yet if they're even. Maybe it doesn't. Yeah, I don't think it does, because of the m x 2s.)
- If m and/or n are odd, the pattern of Xs and Os will be alternating in the middle row/column. (I am unsure about this.)
- In any m x n and in any vertical or horizontal group of three, there will be at least one O and one X. (Also unsure about this one.)
- The patterns for the rows will be either O+XXOs+X, X+OXXs+O, XOXO... or OXOX. (Again, unsure...)







