Friday, September 5, 2014

September 5

M x Ns:

(when m and n are equivalent to 1 or 0 (mod 3))


The cases: [also, when I say "symmetrical" I mean reflecting over the vertical results in the same grid. Any proofs/reasons can be "rotated" to deal with symmetry over the horizontal.]


1] The number grid and the XO grid are symmetrical

2] The number grid is symmetrical, but the XO grid is not. But hey, this isn't actually possible when m and n aren't equivalent to 2 (mod 3)
3] The number grid isn't symmetrical, but the XO grid is.
4] The number grid and the XO grid are not symmetrical.

Case 1:
It has to be solvable.

Why? If we try to flip it, we get the same thing. If we try to 'solve' the number grid in such a way that the resulting XO is not symmetrical we'll run into issues... I guess I need to prove this. This is addressed under case 2.


Case 2:

Is impossible when m and n are equivalent to 1 or 0 (mod 3). (I think...)

For this to be possible, we need an asymmetrical XO grid such that every grid square (j, i) is adjacent to the same number of Xs that grid square (m-j+1, n-i+1) is.

Case 3:

This is also impossible. 

Since the XO grid is symmetrical, the corresponding number to grid square (j, i) is the same as the corresponding number to grid square (m-j+1, n-i+1). Which would mean that the number grid has to be symmetrical.

Case 4:

Has to be solvable... I think.

Triangles!

Cells are adjacent if they share an edge. The highest number in any cell is 4. At the moment, I think unsolvability has to do with what shape is in the "center" of the grid–it can be either a hexagon or an "upside-down" triangle...though I really have nothing to base that on. And this is what I have so far: 


2 comments:

  1. Also, the textbook is supposed to arrive on Tuesday.

    ReplyDelete
  2. Hmm... so it seems like you're trying to relate the problem of whether a puzzle is uniquely solvable into a problem of whether the number grids and XO grid are symmetrical. This seems somewhat interesting, but I'm afraid I'm not really following your reasoning. (Also, I'm a little doubtful that this approach will "pan out", but I don't know. Maybe there's something there.)

    The work on triangles is exciting. What makes you think the length 3 triangle will be uniquely solvable again? Are you conjecturing that the solvability alternates every other time? That would be VERY interesting if triangles (3-sided) are really based on MOD 2, when the squares (4 sided) were based on MOD 3. If that's true (which we don't know at this point) that might be coincidental, but it also might smack of some "deeper" connection.

    I would recommend you keep looking at the triangles, and hold off on the "unique solvability of m x n rectangles" until after you do a couple of weeks work with the textbook, and we can revisit the problem.

    It might also be possible to look at "m x n grids" of triangles, if you arrange them in a parallelogram, instead of a rectangle. e.g., something like: http://euler.slu.edu/escher/upload/thumb/6/6f/Triangle-tess.svg/710px-Triangle-tess.svg.png

    ReplyDelete