Three-dimensional edge-matching puzzle

Last updated

A three-dimensional edge-matching puzzle is a type of edge-matching puzzle or tiling puzzle involving tiling a three-dimensional area with (typically regular) polygonal pieces whose edges are distinguished with colors or patterns, in such a way that the edges of adjacent pieces 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]

Contents

Three-dimensional 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 three-dimensional edge-matching puzzles include the Dodek Duo, The Enigma, Mental Misery, [3] and Kadon Enterprises' range of three-dimensional edge-matching puzzles. [4]

See also

Related Research Articles

Pentomino Geometric shape formed from five squares

Derived from the Greek word for '5', and "domino", a pentomino is a polyomino of order 5, that is, a polygon in the plane made of 5 equal-sized squares connected edge-to-edge. When rotations and reflections are not considered to be distinct shapes, there are 12 different free pentominoes. When reflections are considered distinct, there are 18 one-sided pentominoes. When rotations are also considered distinct, there are 63 fixed pentominoes.

Polyomino Geometric shapes formed from squares

A polyomino is a plane geometric figure formed by joining one or more equal squares edge to edge. It is a polyform whose cells are squares. It may be regarded as a finite subset of the regular square tiling.

A puzzle is a game, problem, or toy that tests a person's ingenuity or knowledge. In a puzzle, the solver is expected to put pieces together in a logical way, in order to arrive at the correct or fun solution of the puzzle. There are different genres of puzzles, such as crossword puzzles, word-search puzzles, number puzzles, relational puzzles, and logic puzzles. The academic study of puzzles is called enigmatology.

Jigsaw puzzle Type of tiling puzzle

A jigsaw puzzle is a tiling puzzle that requires the assembly of often oddly shaped interlocking and mosaiced pieces, each of which typically has a portion of a picture; when assembled, they produce a complete picture.

Packing problems Problems which attempt to find the most efficient way to pack objects into containers

Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be related to real-life packaging, storage and transportation issues. Each packing problem has a dual covering problem, which asks how many of the same objects are required to completely cover every region of the container, where objects are allowed to overlap.

Tessellation Tiling of a plane in mathematics

A tessellation or tiling is the covering of a surface, often a plane, using one or more geometric shapes, called tiles, with no overlaps and no gaps. In mathematics, tessellation can be generalized to higher dimensions and a variety of geometries.

Hexomino Geometric shape formed from six squares

A hexomino is a polyomino of order 6, that is, a polygon in the plane made of 6 equal-sized squares connected edge-to-edge. The name of this type of figure is formed with the prefix hex(a)-. When rotations and reflections are not considered to be distinct shapes, there are 35 different free hexominoes. When reflections are considered distinct, there are 60 one-sided hexominoes. When rotations are also considered distinct, there are 216 fixed hexominoes.

Polyform 2D shape constructed by joining together identical basic polygons

In recreational mathematics, a polyform is a plane figure constructed by joining together identical basic polygons. The basic polygon is often a convex plane-filling polygon, such as a square or a triangle. More specific names have been given to polyforms resulting from specific basic polygons, as detailed in the table below. For example, a square basic polygon results in the well-known polyominoes.

Polycube Shape made from cubes joined together

A polycube is a solid figure formed by joining one or more equal cubes face to face. Polycubes are the three-dimensional analogues of the planar polyominoes. The Soma cube, the Bedlam cube, the Diabolical cube, the Slothouber–Graatsma puzzle, and the Conway puzzle are examples of packing problems based on polycubes.

Net (polyhedron) Edge-joined polygons which fold into a polyhedron

In geometry, a net of a polyhedron is an arrangement of non-overlapping edge-joined polygons in the plane which can be folded to become the faces of the polyhedron. Polyhedral nets are a useful aid to the study of polyhedra and solid geometry in general, as they allow for physical models of polyhedra to be constructed from material such as thin cardboard.

LITS Logic puzzle

LITS, formerly known as Nuruomino (ヌルオミノ), is a binary determination puzzle published by Nikoli.

Tiling puzzle Puzzles involving the assembly of flat shapes

Tiling puzzles are puzzles involving two-dimensional packing problems in which a number of flat shapes have to be assembled into a larger given shape without overlaps. Some tiling puzzles ask you to dissect a given shape first and then rearrange the pieces into another shape. Other tiling puzzles ask you to dissect a given shape while fulfilling certain conditions. The two latter types of tiling puzzles are also called dissection puzzles.

Sliding puzzle Puzzle game involving sliding pieces to achieve certain configurations

A sliding puzzle, sliding block puzzle, or sliding tile puzzle is a combination puzzle that challenges a player to slide pieces along certain routes to establish a certain end-configuration. The pieces to be moved may consist of simple shapes, or they may be imprinted with colours, patterns, sections of a larger picture, numbers, or letters.

The 3-partition problem is a strongly NP-complete problem in computer science. The problem is to decide whether a given multiset of integers can be partitioned into triplets that all have the same sum. More precisely:

Eternity II puzzle Edge-matching puzzle

The Eternity II puzzle is an edge-matching puzzle launched on 28 July 2007. It was developed by Christopher Monckton and marketed and copyrighted by TOMY UK Ltd as a successor to the original Eternity puzzle. The puzzle was part of a competition in which a $2 million prize was offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found.

Edge-matching puzzle

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.

Penrose tiling Non-periodic tiling of the plane

A Penrose tiling is an example of an aperiodic tiling. Here, a tiling is a covering of the plane by non-overlapping polygons or other shapes, and aperiodic means that shifting any tiling with these shapes by any finite distance, without rotation, cannot produce the same tiling. However, despite their lack of translational symmetry, Penrose tilings may have both reflection symmetry and fivefold rotational symmetry. Penrose tilings are named after mathematician and physicist Roger Penrose, who investigated them in the 1970s.

Hinged dissection Geometric partition where pieces are connected by "hinged" points

In geometry, a hinged dissection, also known as a swing-hinged dissection or Dudeney dissection, is a kind of geometric dissection in which all of the pieces are connected into a chain by "hinged" points, such that the rearrangement from one figure to another can be carried out by swinging the chain continuously, without severing any of the connections. Typically, it is assumed that the pieces are allowed to overlap in the folding and unfolding process; this is sometimes called the "wobbly-hinged" model of hinged dissection.

Rectangle packing is a packing problem where the objective is to determine whether a given set of small rectangles can be placed inside a given large polygon, such that no two small rectangles overlap. Several variants of this problem have been studied.

References

  1. Erik D. Demaine, Martin L. Demaine. "Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity" (PDF). Retrieved 2007-08-12.
  2. "Rob's puzzle page: Edge Matching" . Retrieved 2007-08-12.
  3. "Rob's puzzle page: Pattern Puzzles" . Retrieved 2009-06-22.
  4. "Kadon Enterprises, More About Edgematching" . Retrieved 2009-06-22.