Analysis and Copyright : ISHINO Keiichiro (2005). MacMahon's Color Tiles (Percy Alexander MacMahon) is famous color tiling puzzle. That is using 4 colored 24 equilateral triangles, 3 colored 24 squares and etc. Here, the problem of arranging 9 squares to 3×3 is taken up. This puzzle has many variations. Such as for instance: matches color on edges, matches color on vertexes, cannot rotate the pieces, can flip over the pieces, includes same color in a piece, exists identical piece, etc.
I think that the selection of the piece of this existing kind of puzzle is a random selection by the trial and error.
When same color is not included in a piece, there are 96 kind of piece that uses 4 colors pair. Select different 9 pieces, and match color on edges. Surrounding colors are arbitrary. The pieces cannot be flipped over.
0 | ABCD | 1 | ABDC | 2 | ACBD | 3 | ACDB | 4 | ADBC | 5 | ADCB |
---|---|---|---|---|---|---|---|---|---|---|---|
6 | ABCd | 7 | ABDc | 8 | ACBd | 9 | ACDb | 10 | ADBc | 11 | ADCb |
12 | ABcD | 13 | ABdC | 14 | ACbD | 15 | ACdB | 16 | ADbC | 17 | ADcB |
18 | ABcd | 19 | ABdc | 20 | ACbd | 21 | ACdb | 22 | ADbc | 23 | ADcb |
24 | AbCD | 25 | AbDC | 26 | AcBD | 27 | AcDB | 28 | AdBC | 29 | AdCB |
30 | AbCd | 31 | AbDc | 32 | AcBd | 33 | AcDb | 34 | AdBc | 35 | AdCb |
36 | AbcD | 37 | AbdC | 38 | AcbD | 39 | AcdB | 40 | AdbC | 41 | AdcB |
42 | Abcd | 43 | Abdc | 44 | Acbd | 45 | Acdb | 46 | Adbc | 47 | Adcb |
48 | aBCD | 49 | aBDC | 50 | aCBD | 51 | aCDB | 52 | aDBC | 53 | aDCB |
54 | aBCd | 55 | aBDc | 56 | aCBd | 57 | aCDb | 58 | aDBc | 59 | aDCb |
60 | aBcD | 61 | aBdC | 62 | aCbD | 63 | aCdB | 64 | aDbC | 65 | aDcB |
66 | aBcd | 67 | aBdc | 68 | aCbd | 69 | aCdb | 70 | aDbc | 71 | aDcb |
72 | abCD | 73 | abDC | 74 | acBD | 75 | acDB | 76 | adBC | 77 | adCB |
78 | abCd | 79 | abDc | 80 | acBd | 81 | acDb | 82 | adBc | 83 | adCb |
84 | abcD | 85 | abdC | 86 | acbD | 87 | acdB | 88 | adbC | 89 | adcB |
90 | abcd | 91 | abdc | 92 | acbd | 93 | acdb | 94 | adbc | 95 | adcb |
A to D, a to d means a color,
A and a,
B and b,
C and c,
D and d are the same color pairs respectively.
The 0th ABCD corresponds to the left figure.
It is possible to make it to the combination of small numbers as much as possible by substituting a suitable color for an arbitrary combination. For instance, 20 21 22 37 38 54 58 74 76 makes to 0 1 3 30 35 58 65 90 95 by substituting AaBbCcDd to CcaADdbB.
20 | ACbd | → | 0 | ABCD |
---|---|---|---|---|
21 | ACdb | → | 3 | ACDB |
22 | ADbc | → | 35 | AdCb |
37 | AbdC | → | 1 | ABDC |
38 | AcbD | → | 30 | AbCd |
54 | aBCd | → | 58 | aDBc |
58 | aDBc | → | 95 | adcb |
74 | acBD | → | 90 | abcd |
76 | adBC | → | 65 | aDcB |
Moreover, the color pair such as A and a is 12 necessary for the solution. When 9 chosen pieces don't have the pair 12, it doesn't have a solution obviously. The combination above has the pair 16.
The normalized combination that chooses 9 different from 96 kinds and has over 12 color pairs is as follows:
Total combinations | 1,296,543,270,880 | 96C9 |
Normalized combinations | 2,911,418,829 | over 12 color pairs |
Combinations with solution | 648,813,123 | |
Combinations with max solution | 1 | 655 solutions |
Combinations with unique solution | 280,744,605 |
It is understood that the combination with unique solution is not too unusual. The combination with the maximum solution is as follows that has 655 solutions. In parentheses, the number of pairs is shown.
Yoshiaki Hirano instituted the following problems (2005/04):
I thought that such combinations did not exist. But, such 210 kinds of combinations exist about the followings: (Sushi Puzzle and Kamon Puzzle are one of such combinations)
|
|
|
The highlight combinations are better than others.
When the pieces can be flipped over, there are 48 kind of piece.
0 | ABCD | 1 | ABDC | 2 | ACBD | ||||||
---|---|---|---|---|---|---|---|---|---|---|---|
6 | ABCd | 7 | ABDc | 8 | ACBd | 9 | ACDb | 10 | ADBc | 11 | ADCb |
12 | ABcD | 13 | ABdC | 14 | ACbD | ||||||
18 | ABcd | 19 | ABdc | 20 | ACbd | 21 | ACdb | 22 | ADbc | 23 | ADcb |
30 | AbCd | 31 | AbDc | 32 | AcBd | ||||||
42 | Abcd | 43 | Abdc | 44 | Acbd | ||||||
48 | aBCD | 49 | aBDC | 50 | aCBD | ||||||
54 | aBCd | 55 | aBDc | 56 | aCBd | 57 | aCDb | 58 | aDBc | 59 | aDCb |
60 | aBcD | 61 | aBdC | 62 | aCbD | ||||||
66 | aBcd | 67 | aBdc | 68 | aCbd | 69 | aCdb | 70 | aDbc | 71 | aDcb |
78 | abCd | 79 | abDc | 80 | acBd | ||||||
90 | abcd | 91 | abdc | 92 | acbd |
The normalized combination that chooses 9 different from 48 kinds is as follows:
Total combinations | 1,677,106,640 | 48C9 |
Normalized combinations | 3,956,251 | over 12 color pairs |
Combinations with solution | 3,572,154 | |
Combinations with max solution | 1 | 9,812 solutions |
Combinations with unique solution | 70,803 |
The combination with the maximum solution is as follows that has 9,812 solutions.
The combination that have unique solution even if all 9 pieces place the center is the following 1 combination. ☞ 2-side Match
When same color is not included in a piece, there are 30 kind of piece that uses 5 colors. Select different 9 pieces, and match color on edges. Surrounding colors are arbitrary. The pieces cannot be flipped over.
0 | ABCD | 1 | ABDC | 2 | ACBD | 3 | ACDB | 4 | ADBC | 5 | ADCB |
---|---|---|---|---|---|---|---|---|---|---|---|
6 | ABCE | 7 | ABEC | 8 | ACBE | 9 | ACEB | 10 | AEBC | 11 | AECB |
12 | ABDE | 13 | ABED | 14 | ADBE | 15 | ADEB | 16 | AEBD | 17 | AEDB |
18 | ACDE | 19 | ACED | 20 | ADCE | 21 | ADEC | 22 | AECD | 23 | AEDC |
24 | BCDE | 25 | BCED | 26 | BDCE | 27 | BDEC | 28 | BECD | 29 | BEDC |
A to E means a color.
The 0th ABCD corresponds to the left figure.
It is possible to make it to the combination of small numbers as much as possible by substituting a suitable color for an arbitrary combination. For instance, 2 6 8 15 16 18 20 24 26 makes to 0 1 6 7 14 15 20 21 24 by substituting ABCDE to BDCEA.
2 | ACBD | → | 24 | BCDE |
---|---|---|---|---|
6 | ABCE | → | 1 | ABDC |
8 | ACBE | → | 0 | ABCD |
15 | ADEB | → | 14 | ADBE |
16 | AEBD | → | 15 | ADEB |
18 | ACDE | → | 6 | ABCE |
20 | ADCE | → | 7 | ABEC |
24 | BCDE | → | 20 | ADCE |
26 | BDCE | → | 21 | ADEC |
The normalized combination that chooses 9 different from 30 kinds is as follows:
Total combinations | 14,307,150 | 30C9 |
Normalized combinations | 119,507 | |
Combinations with solution | 119,505 | |
Combinations with max solution | 2 | 763 solutions |
Combinations with min solution | 5 | 4 solutions |
The combinations with the maximum solution are as follows that has 763 solutions.
The combinations with the minimum solution are as follows that has 4 solutions. There are no unique solutions.
The combinations without a solution are the followings:
The combinations that have unique solution even if all 9 pieces place the center are not exist.
When the pieces can be flipped over, there are 15 kind of piece.
0 | ABCD | 1 | ABDC | 2 | ACBD |
---|---|---|---|---|---|
6 | ABCE | 7 | ABEC | 8 | ACBE |
12 | ABDE | 13 | ABED | 14 | ADBE |
18 | ACDE | 19 | ACED | 20 | ADCE |
24 | BCDE | 25 | BCED | 26 | BDCE |
The normalized combination that chooses 9 different from 15 kinds is as follows:
Total combinations | 5,005 | 15C9 |
Normalized combinations | 58 | |
Combinations with solution | 58 | |
Combinations with max solution | 1 | 30,228 solutions |
Combinations with min solution | 1 | 17,872 solutions |
The combinations that have unique solution even if all 9 pieces place the center are not exist.
When same color may be included in a piece, there are 70 kind of piece that uses 4 colors. Select different 9 pieces, and match color on edges. Surrounding colors are arbitrary. The pieces cannot be flipped over.
0 | ABCD | 1 | ABDC | 2 | ACBD | 3 | ACDB | 4 | ADBC | 5 | ADCB |
---|---|---|---|---|---|---|---|---|---|---|---|
6 | AABC | 7 | AACB | 8 | AABD | 9 | AADB | 10 | AACD | 11 | AADC |
12 | ACBB | 13 | ABBC | 14 | ADBB | 15 | ABBD | 16 | BBCD | 17 | BBDC |
18 | ABCC | 19 | ACCB | 20 | ADCC | 21 | ACCD | 22 | BDCC | 23 | BCCD |
24 | ABDD | 25 | ADDB | 26 | ACDD | 27 | ADDC | 28 | BCDD | 29 | BDDC |
30 | ABAC | 31 | ABAD | 32 | ACAD | 33 | ABCB | 34 | ABDB | 35 | BCBD |
36 | ACBC | 37 | ACDC | 38 | BCDC | 39 | ADBD | 40 | ADCD | 41 | BDCD |
42 | AABB | 43 | AACC | 44 | AADD | 45 | BBCC | 46 | BBDD | 47 | CCDD |
48 | ABAB | 49 | ACAC | 50 | ADAD | 51 | BCBC | 52 | BDBD | 53 | CDCD |
54 | AAAB | 55 | AAAC | 56 | AAAD | 57 | ABBB | 58 | BBBC | 59 | BBBD |
60 | ACCC | 61 | BCCC | 62 | CCCD | 63 | ADDD | 64 | BDDD | 65 | CDDD |
66 | AAAA | 67 | BBBB | 68 | CCCC | 69 | DDDD |
A to D means a color.
The 0th ABCD corresponds to the left figure.
It is possible to make it to the combination of small numbers as much as possible by substituting a suitable color for an arbitrary combination. For instance, 1 3 23 36 38 39 41 42 69 makes to 0 5 6 30 32 33 35 47 67 by substituting ABCD to DCAB.
1 | ABDC | → | 5 | ADCB |
---|---|---|---|---|
3 | ACDB | → | 0 | ABCD |
23 | BCCD | → | 6 | AABC |
36 | ACBC | → | 32 | ACAD |
38 | BCDC | → | 30 | ABAC |
39 | ADBD | → | 35 | BCBD |
41 | BDCD | → | 33 | ABCB |
42 | AABB | → | 47 | CCDD |
69 | DDDD | → | 67 | BBBB |
The normalized combination that chooses 9 different from 70 kinds is as follows:
Total combinations | 65,033,528,560 | 70C9 |
Normalized combinations | 2,713,252,941 | |
Combinations with solution | 2,590,002,702 | |
Combinations with unique solution | 31,611,564 |
The combinations that have unique solution even if all 9 pieces place the center are not exist.
When the pieces can be flipped over, there are 55 kind of piece.
0 | ABCD | 1 | ABDC | 2 | ACBD | ||||||
---|---|---|---|---|---|---|---|---|---|---|---|
6 | AABC | 8 | AABD | 10 | AACD | ||||||
12 | ACBB | 14 | ADBB | 16 | BBCD | ||||||
18 | ABCC | 20 | ADCC | 22 | BDCC | ||||||
24 | ABDD | 26 | ACDD | 28 | BCDD | ||||||
30 | ABAC | 31 | ABAD | 32 | ACAD | 33 | ABCB | 34 | ABDB | 35 | BCBD |
36 | ACBC | 37 | ACDC | 38 | BCDC | 39 | ADBD | 40 | ADCD | 41 | BDCD |
42 | AABB | 43 | AACC | 44 | AADD | 45 | BBCC | 46 | BBDD | 47 | CCDD |
48 | ABAB | 49 | ACAC | 50 | ADAD | 51 | BCBC | 52 | BDBD | 53 | CDCD |
54 | AAAB | 55 | AAAC | 56 | AAAD | 57 | ABBB | 58 | BBBC | 59 | BBBD |
60 | ACCC | 61 | BCCC | 62 | CCCD | 63 | ADDD | 64 | BDDD | 65 | CDDD |
66 | AAAA | 67 | BBBB | 68 | CCCC | 69 | DDDD |
The normalized combination that chooses 9 different from 55 kinds is as follows:
Total combinations | 6,358,402,050 | 55C9 |
Normalized combinations | 266,787,966 | |
Combinations with solution | 244,911,124 | |
Combinations with unique solution | 1,001,305 |
The combinations that have unique solution even if all 9 pieces place the center are not exist.
When same color may be included in a piece, there are 24 kind of piece that uses 3 colors. This is a subset of 4 colors set. Select different 9 pieces, and match color on edges. Surrounding colors are arbitrary. The pieces cannot be flipped over.
0 | AABC | 1 | AACB | 2 | ACBB | 3 | ABBC | 4 | ABCC | 5 | ACCB |
---|---|---|---|---|---|---|---|---|---|---|---|
6 | ABAC | 7 | ABCB | 8 | ACBC | 9 | AABB | 10 | AACC | 11 | BBCC |
12 | ABAB | 13 | ACAC | 14 | BCBC | 15 | AAAB | 16 | AAAC | 17 | ABBB |
18 | BBBC | 19 | ACCC | 20 | BCCC | 21 | AAAA | 22 | BBBB | 23 | CCCC |
A to C means a color.
The 0th AABC corresponds to the left figure.
It is possible to make it to the combination of small numbers as much as possible by substituting a suitable color for an arbitrary combination. For instance, 1 2 3 13 16 17 18 21 22 makes to 0 1 3 14 15 16 18 21 22 by substituting ABC to BAC.
1 | AACB | → | 3 | ABBC |
---|---|---|---|---|
2 | ACBB | → | 0 | AABC |
3 | ABBC | → | 1 | AACB |
13 | ACAC | → | 14 | BCBC |
16 | AAAC | → | 18 | BBBC |
17 | ABBB | → | 15 | AAAB |
18 | BBBC | → | 16 | AAAC |
21 | AAAA | → | 22 | BBBB |
22 | BBBB | → | 21 | AAAA |
The normalized combination that chooses 9 different from 24 kinds is as follows:
Total combinations | 1,307,504 | 24C9 |
Normalized combinations | 218,596 | |
Combinations with solution | 215,734 | |
Combinations with max solution | 1 | 25,488 solutions |
Combinations with unique solution | 56 |
The combination with the maximum solution is as follows that has 25,488 solutions.
The combinations with the unique solution are as follows.
|
|
|
The combinations that have unique solution even if all 9 pieces place the center are not exist.
MacMahon's Color Tiles is using all 24 pieces and constructs 6×4. Then surrounding colors are arranged.
When the pieces can be flipped over, there are 21 kind of piece.
0 | AABC | 2 | ACBB | 4 | ABCC | ||||||
---|---|---|---|---|---|---|---|---|---|---|---|
6 | ABAC | 7 | ABCB | 8 | ACBC | 9 | AABB | 10 | AACC | 11 | BBCC |
12 | ABAB | 13 | ACAC | 14 | BCBC | 15 | AAAB | 16 | AAAC | 17 | ABBB |
18 | BBBC | 19 | ACCC | 20 | BCCC | 21 | AAAA | 22 | BBBB | 23 | CCCC |
The normalized combination that chooses 9 different from 21 kinds is as follows:
Total combinations | 293,930 | 21C9 |
Normalized combinations | 49,469 | |
Combinations with solution | 47,690 | |
Combinations with max solution | 1 | 128,224 solutions |
Combinations with min solution | 801 | 4 solutions |
The combinations that have unique solution even if all 9 pieces place the center are not exist.