Friday, January 9, 2015

January 9

Rect, self, nodiags:

1 unsolvable if n equiv 2 (mod 3)
2 unsolvable if n equiv 1 (mod 2)
3 unsolvable if n equiv 2 (mod 3)
4 unsolvable if n equiv 4 (mod 5)
5 unsolvable if n equiv 1,2,3,5 (mod 5)
6 unsolvable if n equiv ?? (always solvable ?)
7 unsolvable if n equiv 2 (mod 3)
8 unsolvable if n equiv 1 (mod 2)
9 unsolvable if n equiv ?
The pattern here looks pretty complex… If anything it could be:
If m equiv 1 (mod 6), then a m by n is unsolvable if n equiv 2 (mod 3). If m equiv 2 (mod 6), then a m by n is unsolvable if n equiv 1 (mod 2). If m equiv 3 (mod 6), then it's unsolvable when n equiv 2 (mod 3). If m equiv 4 (mod 6), it's unsolvable if n equiv 4 (mod 5). If m equiv 5 (mod 6), unsolvable if n equiv 1, 2, 3, 5 (mod 5). If m equiv 6 (mod 6) it's always solvable ??
From the spreadsheet, it looks possible that it works out this way, though it's pretty complicated to prove it. On the other hand, rect, nonself, nondiags, looks a bit nicer.
-----------------------------------------------------------------
Rect, nonself, nodiags:

1 unsolvable if n equiv 1 (mod 2)
2 unsolvable if n equiv 2 (mod 3)
3 unsolvable if n equiv 1 (mod 2)
4 unsolvable if n equiv 4 (mod 5)
5 unsolvable if n equiv 1,2,3,5 (mod 6)
6 unsolvable if n equiv 6 (mod 7)
7 unsolvable if n equiv 1 (mod 2)
8 unsolvable if n equiv 2 (mod 3)
9 unsolvable if n equiv 1,2,3,5 (mod 6)
10 unsolvable if n equiv 10 (mod 11)
11 unsolvable if n equiv 1,2,3,5 (mod 6)
12 unsolvable if n equiv 12 (mod 13)
13 unsolvable if n equiv 1,3,5,6,7,9,11,13 (mod 14)
14 unsolvable if n equiv 2,4,5,8,9,11,14 (mod 15)
15 unsolvable if n equiv 1 (mod 2)
16 unsolvable if n equiv 16 (mod 17)
17 unsolvable if n equiv 1,2,3,5 (mod 6)
18 unsolvable if n equiv 18 (mod 19)
So far, it looks like there are a few patterns of solvability (assuming these are correct…):
1) An m by n is unsolvable if n equiv 1 (mod 2).
2) An m by n is unsolvable if n equiv 2 (mod 3)
3) An m by n is unsolvable if n equiv m (mod [m+1])
4) An m by n is unsolvable if n equiv 1,2,3,5 (mod 6)
5) An m by n is unsolvable if n equiv {………} (mod [m+1])
I put a file in the dropbox with this information, it's rects_nonself_nondiags_solvability.
Also, here's a picture:
Each of the patterns is color coded. Also, with pattern 5 it looks like it can be subdivided. The list of numbers that is unsolvable appears to be odd numbers with a group 3 consecutive numbers (including an even number, like 5,6,7), or a group of even numbers with a group of 3 consecutive numbers, or some other thing……… The patterns for a puzzle with m being 13, 21, 21, 25, and 33 appear to be the first kind (odd numbers + group of 3). The patterns for a puzzle with m being 14 or 20 appear to be the second kind (even numbers + group of 3).
At this point, I don't have any general patterns. This is just a guess, but I think solvability might be more easily determined by the product, mn, but I'm not sure.

1 comment: