Triangle Arrangement:
(about like so:)
I've been working on the 6 case, and I'm not sure that it isn't solvable. So far, it seems that the pattern of numbers increasing towards the middle sort of holds. Also, the highest number is a 3, one less than the max.
Parallelogram Arrangement:
This one I haven't gotten into the higher number cases yet. But for the 1 by somethings, it appears to be the same pattern as for the rectangular.


Here's an interesting side question (I think). If a grid size is not always uniquely solvable, then what percentage of XO configurations will yield an "ambigous" (not uniquely solvable) puzzle. Is it a high fraction? Can we *prove* that it will be at least half, or at least 10%, or anything like that?
ReplyDeleteIf we could show that, then we could take a grid size that we don't know the answer for (say the 2x3 triangle parallelogram) and generate some number of random puzzles of that size, and test each one to see if it's solvable, and then be able to use a probabilistic argument to argue whether it's solvable or not. This wouldn't constitute proof, but we might be able to say that it's always uniquely solvable "with 99% confidence" or something like that.
Not sure if this is possible or not, but it just occurred to me...
While that might be interesting, they might also be tangential. I do rather like the first suggestion and am more skeptical of the second.
ReplyDeleteSo, you're working on the 6, I assume you've tried extrapolating your 2 and 4 counter examples. There are probably more counter examples for the smaller cases, which might extrapolate better. (not sure, just guessing)
It's very tempting to print a page of triangles and start fiddling...
Have you thought at all about what it is you're doing as you go from XO's to numbers, could we try to write equations for some of the little cases and then move that into matrices for the bigger cases? might not help
Here's another idea, the 2 case failed on all 2's. Can you force the 4 case to fail on all 2's? What about all 1's? maybe try 7 or 8 if 6 is causing trouble. (maybe six is solvable...)
ReplyDelete