Edge-matching puzzle

From Wikipedia, the free encyclopedia
  (Redirected from TetraVex)
Jump to navigation Jump to search
A partially completed Eternity II edge-matching puzzle

An edge-matching puzzle is a type of tiling puzzle involving tiling an area with (typically regular) polygons whose edges are distinguished with colours or patterns, in such a way that the edges of adjacent tiles match.

Edge-matching puzzles are known to be NP-complete, and capable of conversion to and from equivalent jigsaw puzzles and polyomino packing puzzle.[1]

The first edge-matching puzzles were patented in the U.S. by E. L. Thurston in 1892.[2] Current examples of commercial edge-matching puzzles include the Eternity II puzzle, Tantrix, Kadon Enterprises' range of edge-matching puzzles, and the Edge Match Puzzles iPhone app.

Notable variations[edit]

MacMahon Squares[edit]

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.

TetraVex[edit]

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 board there are horizontal and vertical pairs that must match and numbers along the edges that can be chosen arbitrarily. Hence there are choices of 10 digits, i.e. 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]

Hexagons[edit]

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.

Three dimensions[edit]

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]

Incorporation of edge matching[edit]

Part of a Carcassonne game showing matching edges

The Carcassonne board game employs edge matching to constrain where its square tiles may be placed. The original game has three types of edges: fields, roads and cities.

See also[edit]

References[edit]

  1. ^ Erik D. Demaine, Martin L. Demaine. "Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity" (PDF). Retrieved 2007-08-12.
  2. ^ a b "Rob's puzzle page: Edge Matching". Archived from the original on 2007-10-22. Retrieved 2007-08-12.
  3. ^ Gardner, Martin (2009). Sphere Packing, Lewis Caroll and Reversi. Cambridge University Press.
  4. ^ MacMahon, Percy Alexander (1921). New mathematical pastimes. Gerstein - University of Toronto. Cambridge, University Press.
  5. ^ Steckles, Katie. Blackboard Bold: MacMahon Squares. Retrieved 10 March 2021.
  6. ^ Guy. Cube Root of 31. Wang Tiles. Retrieved 12 April 2021.
  7. ^ Wade Philpott (credited). Kadon Enterprises. Multimatch. Retrieved 12 April 2021.
  8. ^ Whittum, Christopher (2013). Energize Education Through Open Source. pg 32.
  9. ^ Gagné, Marcel (2006). Moving to Ubuntu Linux.
  10. ^ "The Birth of Visual Basic". Forestmoon.com. Retrieved 2010-05-11.
  11. ^ "License - README". gnome-games. gnome.org. 2011. Retrieved 2012-10-02.
  12. ^ "TetraVex is NP-complete". Information Processing Letters, Volume 99, Issue 5, Pages 171–174. 15 September 2006.
  13. ^ Bansal, Pulkit(2010). "Code for solving Tetravex using Douglas–Rachford algorithm". Retrieved 10 March 2021.
  14. ^ Linstrom, Scott B.; Sims, Brailey (2020). Survey: Sixty years of Douglas Rachford. Cambridge University Press.
  15. ^ "Rob's puzzle page: Pattern Puzzles". Retrieved 2009-06-22.
  16. ^ "Kadon Enterprises, More About Edgematching". Retrieved 2009-06-22.

External links[edit]