Edge-matching puzzle

A solution to MacMahon Squares with the largest single-color area[3]

MacMahon Squares is the name given to a recreational math puzzle suggested by British mathematician Percy MacMahon, who published a treatise on edge-colouring of a variety of shapes in 1921.[4] This particular puzzle uses 24 tiles consisting of all permutations of 3 colors for the edges of a square. The tiles must be arranged into a 6×4 rectangular area such that all edges match and, furthermore, only one color is used for the outside edge of the rectangle.[5]

This puzzle can be extended to tiles with permutations of 4 colors, arranged in 10×7.[6] In either case, the squares are a subset of the Wang tiles, reducing tiles that are similar under rotation. Solutions number well into the thousands.[7]

MacMahon Squares, along with variations on the idea, was commercialized as Multimatch.

GNOME Tetravex.

TetraVex is a computer game that presents the player with a square grid and a collection of tiles, by default nine square tiles for a 3×3 grid. Each tile has four single-digit numbers, one on each edge. The objective of the game is to place the tiles into the grid in the proper position, completing this puzzle as quickly as possible. The tiles cannot be rotated, and two can be placed next to each other only if the numbers on adjacent edges match.[8][9]

TetraVex was inspired by "the problem of tiling the plane" as described by Donald Knuth on page 382 of Volume 1: Fundamental Algorithms, the first book in his series The Art of Computer Programming. It was named by Scott Ferguson, the development lead and an architect of the first version of Visual Basic, who wrote it for Windows Entertainment Pack 3.[10]

TetraVex is also available as an open source game in the GNOME Games collection.[11]

The possible number of TetraVex can be counted. On a ${\displaystyle n\times {}n}$ board there are ${\displaystyle n(n-1)}$ horizontal and vertical pairs that must match and ${\displaystyle 4n}$ numbers along the edges that can be chosen arbitrarily. Hence there are ${\displaystyle 2n(n-1)+4n=2n(n+1)}$ choices of 10 digits, i.e. ${\displaystyle 10^{2n(n+1)}}$ possible boards.

Deciding if a TetraVex puzzle has a solution is in general NP-complete.[12] Its computational approach involves the Douglas-Rachford algorithm.[13][14]

A single-cross serpentile

Serpentiles are the hexagonal tiles used in various abstract strategy games such as Psyche-Paths, Kaliko, and Tantrix. Within each serpentile, the edges are paired, thus restricting the set of tiles in such a way that no edge color occurs an odd number of times within the hexagon.

Mathematically, edge-matching puzzles are two-dimensional. A 3D edge-matching puzzle is such a puzzle that is not flat in Euclidean space, so involves tiling a three-dimensional area such as the surface of a regular polyhedron. As before, polygonal pieces have distinguished edges to require that the edges of adjacent pieces match.

3D edge-matching puzzles are not currently under direct U.S. patent protection, since the 1892 patent by E. L. Thurston has expired.[2] Current examples of commercial puzzles include the Dodek Duo, The Enigma, Mental Misery,[15] and Kadon Enterprises' range of three-dimensional edge-matching puzzles.[16]