Tuesday, August 19, 2014

August 19


Today, I worked on finding the number of configurations without transformations (as in, XO=OX and [XO,XO]=[OX,OX]=[XO,OX]=[OX,XO]) The pattern for when n is variable and m=1 was relatively simple after connecting it to Pascal's triangle and then realizing that the sums of rows in Pascal's are just powers of 2. The pattern for when m=2 has been a bit more difficult to figure out, and I'm not sure if what I have written is accurate, because I haven't finished working with the 4x2 and 5x2 cases.

In addition, I corrected one mistake: 4x4 is indeed solvable. The example I had was incorrect.  I assume the other mistake was in the 3x3 but have not had the chance to take a look at that as of yet.

I also added a row at the bottom for nxm but haven't really done much there yet.

2 comments:

  1. Just figuring out it was 2^nm was all I was wanting, I don't know what you would do with it after that. I'll have to think about the without transform ones. Those might be useful. The X's and O's, look great!

    You may want to look harder at the "ones". and maybe expand the table a bit there, 6x1,7x1,8x1, etc. Those should be easier to do than some of the later ones and they should be informative.

    ReplyDelete
  2. Hmm, yes. This is good progress - however, there are still errors in your "solvability" column. Specifically, *not all* Nx1 puzzles are solvable.

    Keep in mind that by "solvable", we mean "always uniquely solvable" regardless of how the X's and O's are arranged. But based on your 2x2 example, I think you already understood that.

    ReplyDelete