This article needs additional citations for verification .(May 2021) |
MacMahon Squares are an edge-matching puzzle first published by Percy MacMahon in 1921, [1] using 24 unique squares with 3-color patterns; each of the four edges is assigned a single color. The complete set of 24 squares are organized next to each other by matching edge colors to create a 4 by 6 grid. Such tessellation puzzles have multiple variants, which are determined by restrictions on how to arrange the 24 squares. This game has also been commercialized in numerous physical forms, by various companies.
MacMahon squares was first published in Percy Alexander MacMahon's 1921 treatise New Mathematical Pastimes. [1] The original version consisted of one copy of each of the 24 different squares that can be made by coloring the edges of a square with one of three colors. (Here "different" means up to rotations.) The goal is to arrange the squares into a 4 by 6 grid so that when two squares share an edge, the common edge is the same color in both squares.
In 1964, a supercomputer was used to produce 12,261 solutions to the basic version of the MacMahon Squares puzzle, with a runtime of about 40 hours. [2]
Single color | Two colors | Three colors | |||||||
---|---|---|---|---|---|---|---|---|---|
Quads [lower-alpha 2] | Triples | Doubles | Doubles | ||||||
1111 | 1112 | 1113 | 1122 | 1133 | 1123 | 1132 | 1213 | ||
2222 | 1222 | 2223 | 1212 | 2233 | 1223 | 1322 | 1232 | ||
3333 | 1333 | 2333 | 1313 | 2323 | 1233 | 1332 | 1323 |
The MacMahon Squares game is an example of an edge-matching puzzle. The family of such problems is NP-complete. The first part of New Mathematical Diversions describes these games in general, starting with linear forms (dominoes), then progressing in detail with similar games using tiles shaped as equilateral triangles, squares, right isoceles triangles, cubes, and hexagons. [1] : Part I, 1–49
There are a total of 24 distinct squares for 3 colors. For an arbitrary number of colors , the number of unique squares can be found by the expression . [1] : 3 [3]
For other shapes with colors, MacMahon determined the number of unique patterns are:
For example, given a triangle with three sides, each of which is assigned one of four possible colors, there are 56 unique patterns.
In his book, MacMahon suggested the ability to define which borders can contact one another, based on their colors. This is by some permutation of the 3 colors, described by Ca,b,c. [1] : 6, 23 Here, a, b, and c represent the shift in colors to which the first, second, and third colors can be matched to. A '1' it is matched to itself, and a '2' signifies that it must be matched with a different color.
For example, C1,1,1 represents 1 to 1, 2 to 2, and 3 to 3, as each of these matchings are represented by the number 1. Alternatively, C1,2 represents 1 to 1 and 2 to 3 as the 1 to 1 matching is represented by the number 1, and the matching between 2 and 3 is represented by 2. More colors can be described in a similar way. For example, a coloring of C1,2,2,2 represents 1 to 1, 2 to 3, 4 to 5, and 6 to 7.
From here we can see that the only possible numbers to describe the pairings by are 1 and 2, since a 3 or above merely skips over a color that would be used the same otherwise because colorings are relative. [1]
Another way to change the puzzle is to restrict which colors squared make up the border colors. In the classic MacMahon squares puzzle, there are a total of 20 places on the border. [1] The number of each color that can be present on these 20 places can be described by Ba,b,c [1] where a, b, and c are the number of each color of the border pieces.
For example, B20,0,0 represents 20 of the first color and none of the rest since the first color already constitutes all available border spaces. Alternatively, B10,10,0 represents 10 of the first color and 10 of the next. More colors can be described in a similar way. For example, a boundary of B22,16,8,2 represents 22 of the first, 16 of the second, 8 of the next, and 2 of the last colors to populate the border colors.
From here we can see that the only possible numbers to describe the number of each color composing the boundary are even numbers, since this would imply an odd number of another color, which would violate the parity of the total number of triangles. [1]
MacMahon Squares, along with variations on the idea, was commercialized as Multimatch.
Another puzzle with similar properties is MacMahon's Cubes, which are a set of 30 cubes, with sides colored one of 6 different colors. Unlike the MacMahon Squares puzzle, we do not include all 2,226 possible cubes, but only the cubes containing exactly 6 distinct colors and 1 of each of the 6 colors. [3]
MacMahon Squares have served as a baseline for numerous other puzzles. Some of these include the Nelson Puzzle, [4] the Wang Tile, and TetraVex.
The commercial board game Trioker , patented in 1969 by Marc Odier, uses triangular tiles first proposed by MacMahon in 1921.
In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets, or sides, with three meeting at each vertex. Viewed from a corner, it is a hexagon and its net is usually depicted as a cross.
In geometry, a regular icosahedron is a convex polyhedron with 20 faces, 30 edges and 12 vertices. It is one of the five Platonic solids, and the one with the most faces.
In geometry, an octahedron is a polyhedron with eight faces. The term is most commonly used to refer to the regular octahedron, a Platonic solid composed of eight equilateral triangles, four of which meet at each vertex.
In geometry, a tetrahedron, also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners. The tetrahedron is the simplest of all the ordinary convex polyhedra.
The Koch snowflake is a fractal curve and one of the earliest fractals to have been described. It is based on the Koch curve, which appeared in a 1904 paper titled "On a Continuous Curve Without Tangents, Constructible from Elementary Geometry" by the Swedish mathematician Helge von Koch.
In geometry, the snub cube, or snub cuboctahedron, is an Archimedean solid with 38 faces: 6 squares and 32 equilateral triangles. It has 60 edges and 24 vertices.
In mathematics, Sperner's lemma is a combinatorial result on colorings of triangulations, analogous to the Brouwer fixed point theorem, which is equivalent to it. It states that every Sperner coloring of a triangulation of an -dimensional simplex contains a cell whose vertices all have different colors.
In geometry, a tetrakis hexahedron is a Catalan solid. Its dual is the truncated octahedron, an Archimedean solid.
In geometry, a disdyakis dodecahedron,, is a Catalan solid with 48 faces and the dual to the Archimedean truncated cuboctahedron. As such it is face-transitive but with irregular face polygons. It resembles an augmented rhombic dodecahedron. Replacing each face of the rhombic dodecahedron with a flat pyramid creates a polyhedron that looks almost like the disdyakis dodecahedron, and is topologically equivalent to it.
Percy Alexander MacMahon was an English mathematician, especially noted in connection with the partitions of numbers and enumerative combinatorics.
The Pyramorphix, also called Pyramorphinx, is a tetrahedral puzzle similar to the Rubik's Cube. It has a total of 8 movable pieces to rearrange, compared to the 20 of the Rubik's Cube. Although it looks like a trivially simple version of the Pyraminx, it is an edge-turning puzzle with the mechanism identical to that of the Pocket Cube.
In combinatorics, the Narayana numbers form a triangular array of natural numbers, called the Narayana triangle, that occur in various counting problems. They are named after Canadian mathematician T. V. Narayana (1930–1987).
An edge-matching puzzle is a type of tiling puzzle involving tiling an area with polygons whose edges are distinguished with colours or patterns, in such a way that the edges of adjacent tiles match.
The Rubik's Cube is the original and best known of the three-dimensional sequential move puzzles. There have been many virtual implementations of this puzzle in software. It is a natural extension to create sequential move puzzles in more than three dimensions. Although no such puzzle could ever be physically constructed, the rules of how they operate are quite rigorously defined mathematically and are analogous to the rules found in three-dimensional geometry. Hence, they can be simulated by software. As with the mechanical sequential move puzzles, there are records for solvers, although not yet the same degree of competitive organisation.
The V-Cube 6 is a 6×6×6 version of the original Rubik's Cube. The first mass-produced 6×6×6 was invented by Panagiotis Verdes and is produced by the Greek company Verdes Innovations SA. Other such puzzles have since been introduced by a number of Chinese companies, most of which have mechanisms which improve on the original. Unlike the original puzzle, it has no fixed facets: the center facets are free to move to different positions.
The V-Cube 7 is a combination puzzle in the form of a 7×7×7 cube. The first mass-produced 7×7×7 was invented by Panagiotis Verdes and is produced by the Greek company Verdes Innovations SA. Other such puzzles have since been introduced by a number of Chinese companies, some of which have mechanisms which improve on the original. Like the 5×5×5, the V-Cube 7 has both fixed and movable center facets.
The Helicopter Cube is a Rubik's Cube-like puzzle invented by Adam G. Cowan in 2005 and built in 2006. It is also in the shape of a cube. At first glance, the Helicopter Cube may seem like a combination of the 2x2x2 and the Skewb, but it actually cuts differently, and twists around cube edges rather than cube faces. The purpose of the puzzle is to scramble the colors, and then restore them back to their original state of a single color per face.
Serpentiles is the name coined by Kurt N. Van Ness for the hexagonal tiles used in various edge-matching puzzle connection abstract strategy games, such as Psyche-Paths, Kaliko, and Tantrix. For each tile, one to three colors are used to draw paths linking the six sides together in various configurations. Each side is connected to another side by a specific path route and color. Gameplay generally proceeds so that players take turns laying down tiles. During each turn, a tile is laid adjacent to existing tiles so that colored paths are contiguous across tile edges.
Le Trioker is an corner-matching puzzle game played using 25 equilateral triangle-shaped tiles. Each corner is marked with zero, one, two, or three dots and newly placed pieces must match the values on pieces already placed on the game board, similar to the gameplay of the earlier Triominoes.
Triangular Dominoes is a variant of dominoes using equilateral triangle tiles, patented by Franklin H. Richards in 1885. Two versions were made: a starter set of 35 unique tiles, with each side numbered from zero to four pips, and an advanced set of 56 unique tiles, with each side numbered from zero to five pips. In both versions, a wild card "boss" tile was included, making 36 and 57 tiles in each complete set, respectively.