In the case that
then the number grid pattern [1, 2,....2,1] will be unsolvable; there are (n-2) 2s.
The unsolvable pattern is XO and then repeating XXOs or the reverse: OXXs then an OX at the end. For example, the number grid that corresponds to XOXXOXXO is [{1 2 2 2 2 2 2 1}]. From that same number grid, we can also produce the XO pattern: OXXOXXOX.
If we take the pattern [{1 2 2 2 ... 2 1}] where there are (n-2) 2s. At slots 1 and n there are 1s. Thus, in the kth slot, there is a 2. In slots k-1, k, and k+1, there must be two Xs. This can either happen as OXX, XOX, or XXO. If the kth slot is an X, then as we move along the 2s in the number grid, the pattern will repeat. If we start with OXX centered on the kth slot, then as we move one way or the other the OXXs repeat. Similarly, if we start with XXO, the XXOs will repeat.
If the kth slot is an O, as we move we will see either of the two patterns. From XOX we can form either XOXO or XOXX; this indicates whether the repeating three-symbol pattern is OXX or XXO.
Conjecture: If
NxMs:
Conjecture:
If
or
then the n by m grid is unsolvable.
For n x 1, the pattern is [{1 2 .... 2 1}] and for n x 2, the pattern is [{2 3 ... 3 2}{2 3...3 2}].
So in the 1st and the nth slot of any row, the number is one less than it is elsewhere. Let's call this digit a. (So for n x 1, the pattern is [{a (a+1) (a+1)...(a+1) a}]). The numbers towards the middle of the grid are higher.
For a grid square on the edge of the grid (that's not a corner) the most Xs in its vicinity is 6; for a corner, that number is 4.
I think the proof is clearer now. I did like the neighborhood image you had made in the previous version, that could be added back in somewhere to explain how the puzzle works or something in the future.
ReplyDelete[{2 3 ... 3 2}{2 3...3 2}] do you know what the respective X's and O's are?
I conjuncture that as the grids get bigger there will be something different in the first and last row (not just first and last column)
I think your next step is to find an nxm puzzle (#'s) with two patterns of X's and O's that give those numbers. (seems likely to be doable, not sure it is)