Between the light and darkness of mathematical knowledge exists an ever-extending boundary that pushes the limits of abstraction into the framework of tangible existence. What can and cannot be known converges with each symbol in a collection of coherent logic. Step after step of pure reasoning reveals an underlying component connecting complexity with simplicity. Oftentimes, this sought after link is not easily discovered. This is immediately true for the ever-growing list of proposed problems that span the entire spectrum of mathematics.

This notion also holds true for problems and puzzles that pose a more recreational nature. I was introduced to one such puzzle during a talk given by the English mathematician Oliver Riordan during my undergrad years at the University of Memphis. Riordan was presenting the methods he and his colleague, mathematician Alex Selby, used to solve the first version of the conundrum known as the Eternity Puzzle. In late 2000, with a combination of intuition, combinatorial reasoning, and statistical inference, Riordan and Selby were able to place all 209 irregularly fashioned pieces of the puzzle in a dodecagon shaped board and claimed the £1 million prize from the puzzle’s inventor, Lord Christopher Monckton.

This was somewhat of a shock since the Eternity Puzzle has an estimated combinations and it would take anyone using brute force computation longer than the entire age of the Universe to compute all possible combinations in hopes of finding a solution. However, mathematics is an employable tool often used to supplant computational complexity. Such was the case with the solution to the Eternity Puzzle.

With the success of selling over 500,000 copies of the first puzzle, Monckton recruited Riordan and Selby to help invent a second version of the puzzle known as the Eternity II Puzzle. Unlike the first version, the Eternity II is very much unsolved. The only people that know of a solution are its creators. Also, unlike the first version, there are 256 square pieces with designs in four directions such that any solution on the 16 x 16 gridded board must preserve a pairwise edge-matching in every direction (see above picture). From its release in 2007, a $2 million prize was offered for its solution that has since expired in 2010.

When I graduated from the University of Memphis, some administrators in the math department gave me one of the copies of the puzzle that Riordan brought with him for the talk. On several occasions I have attempted to solve it with no success. Maybe one day a solution will emerge from the depths of complexity into the realm of simplicity.

Are there still people trying to solve it? What happens if some one does?