The Eternity II puzzle (abbreviated E2 or E II) is an

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 k ...

launched on 28 July 2007. It was developed by

Christopher Monckton Christopher Walter Monckton, 3rd Viscount Monckton of Brenchley (born 14 February 1952) is a British public speaker and hereditary peer. He is known for his work as a journalist, Conservative political advisor, UKIP political candidate, and fo ...

and marketed and copyrighted by

TOMY is a Japanese entertainment company that makes children's toys and merchandise. It was created from a merger on March 1st 2006 of two companies: Tomy (founded in 1924 as Tomiyama, changing the name to Tomy in 1963) and long-time rival Tak ...

UK Ltd as a successor to the original Eternity puzzle. The puzzle was part of a

competition Competition is a rivalry where two or more parties strive for a common goal which cannot be shared: where one's gain is the other's loss (an example of which is a zero-sum game). Competition can arise between entities such as organisms, ind ...

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.

Description

The Eternity II puzzle is an

which involves placing 256 square puzzle pieces into a 16 × 16 grid, constrained by the requirement to match adjacent edges. It has been designed to be difficult to solve by brute-force computer search. Each puzzle piece has its edges on one side marked with different shape/colour combinations (collectively called "colours" here), each of which must match precisely with its neighbouring side on each adjacent piece when the puzzle is complete. The other side of each piece is blank apart from an identifying number, and is not used in the puzzle. Thus, each piece can be used in only 4 orientations. There are 22 colours, not including the grey edges. Five of the colours are found exclusively in the 60 edge-pairs ("diamonds") in the outermost ring, i.e. between the border and corner pieces, while the other 17 are used in the remaining 420 "interior" edge-pairs. The colours are used evenly, with each of the 5 border colours used in exactly 12 edge-pairs, and each of the 17 inner colours used for either 24 edge-pairs (5 colours) or 25 edge-pairs (12 colours). The total number of edge-pairs is 480. One of the five border colours is not found on any corner piece, while all of the 17 inner colours are used at least once on a border piece. There are 4 corner pieces (with two grey sides), 56 border pieces (with one grey side) and 14² = 196 inner pieces (with four coloured sides). Each piece has a unique arrangement of colours, and none of the pieces are rotationally symmetric, so each of the 256 × 4 = 1024 choices of piece and orientation results in a different pattern of edge colours. The puzzle differs from the first Eternity puzzle in that there is a non-optional starter piece (a mandatory hint) which must be placed in a specified position and orientation near the centre of the board.Instruction booklet (PDF, archived)
published on the official website Two clue puzzles were available with the launch of the product, which, if solved, each give a piece position (hint) on the main 256-piece puzzle. Clue Puzzle 1 is a 36-piece square (6 × 6) puzzle and Clue Puzzle 2 is a 72-piece rectangular (12 × 6) puzzle. Two additional clue puzzles of the same dimensions were made available in 2008: the 36-piece Clue Puzzle 3 and the 72-piece Clue Puzzle 4. The rule book states that the puzzle can be solved without using the hints.

Complexity

The number of possible configurations for the Eternity II puzzle, assuming all the pieces are distinct, and ignoring the fixed pieces with pre-determined positions, is 256! × 4²⁵⁶, roughly 1.15 × 10⁶⁶¹. A tighter upper bound to the possible number of configurations can be achieved by taking into account the fixed piece in the center and the restrictions set on the pieces on the edge: 1 × 4! × 56! × 195! × 4¹⁹⁵, roughly 1.12 × 10⁵⁵⁷. A further upper bound can be obtained by considering the position and orientation of the hint pieces obtained through the clue puzzles. In this case the position and orientation of five pieces is known, giving an upper bound of 4! × 56! × 191! × 4¹⁹¹ = 3.11 × 10⁵⁴⁵, yielding a search space 3.70 × 10¹¹⁵ times smaller than the first approximation. To first approximation, the edge-matching constraint reduces the number of valid configurations by a factor of (1/5) for every border edge-pair and (1/17) for every inner edge-pair. The number of valid configurations is then approximated by 4! × 56! × 196! × 4¹⁹⁶ × (1/5)⁶⁰ × (1/17)⁴²⁰ ≈ 16.4, which is very close to unity. This indicates the puzzle has likely been designed to have only one or a few solutions, which maximizes the difficulty: more solutions (looser constraints, e.g. less colours) would make it easier to find a solution (one of many), while tighter constraints decrease the search space, making it easier to locate the (unique) solution. Optimization of the number of colours has been investigated empirically for smaller puzzles, bearing out this observation.

Competition and solution

After the first scrutiny date on 31 December 2008 it was announced that no complete solution had been found. A prize of $10,000 was awarded to Louis Verhaard from Lund in Sweden for a partial solution with 467 matching edges out of 480. Verhaard published three more partial solutions with the same number of matching edges. As of 30 January 2011, the official Eternity II site announces that "The final date for the correct solution of the Eternity II puzzle passes without a winner, and the $2m Prize for a correct solution to the Eternity II puzzle goes unclaimed." No verified complete solution to the Eternity 2 puzzle has ever been published. This includes Christopher Monckton's intended solution, which remains unpublished. Several fake solutions are known to have been circulated online.

History and design

The original Eternity puzzle was a

tiling puzzle 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 (and often without gaps). Some tiling puzzles ask you to dissect a given sh ...

with a million-pound prize, created by Monckton. Launched in June 1999, it was solved by a computer search algorithm designed by Alex Selby and Oliver Riordan, which exploited combinatorial weaknesses of the original puzzle design. The prize money was paid out in full to Selby and Riordan. A puzzle with striking similarities to both eternity puzzles, the Diamond Dilemma, with a deadline in 1990, 10 years before the deadline of the original eternity puzzle, has fewer puzzle pieces, 160 compared with 209 and 256 for the first two eternity puzzles respectively, and yet Diamond Dilemma has not yet been solved in over 25 years. The Eternity II puzzle was designed by Monckton in 2005, this time in collaboration with Selby and Riordan, who designed a computer program that generated the final Eternity II design. According to the mathematical game enthusiast Brendan Owen, the Eternity II puzzle appears to have been designed to avoid the combinatorial flaws of the previous puzzle, with design parameters which appear to have been chosen to make the puzzle as difficult as possible to solve. In particular, unlike the original Eternity puzzle, there are likely only to be a very small number of possible solutions to the problem. Owen estimates that a brute-force backtracking search might take around 2 steps to complete. Monckton was quoted by ''The Times'' in 2005 as saying: :"Our calculations are that if you used the world's most powerful computer and let it run from now until the projected end of the universe, it might not stumble across one of the solutions." Although it has been demonstrated that the class of

s, of which Eternity II is a special case, is in general

NP-complete In computational complexity theory, a problem is NP-complete when: # it is a problem for which the correctness of each solution can be verified quickly (namely, in polynomial time) and a brute-force search algorithm can find a solution by tryin ...

, the same can be said of the general class of polygon packing problems, of which the original Eternity puzzle was a special case. Like the original Eternity puzzle, it is easy to find large numbers of ways to place substantial numbers of pieces on the board whose edges all match, making it seem that the puzzle is easy. However, given the low expected number of possible solutions, it is presumably astronomically unlikely that any given partial solution will lead to a complete solution.

References

External links