SOLUTION – Langford’s Problem
Merry Christmas everybody! On 12/23/2010 I wrote about a curious puzzle called Langford’s Problem. I asked the reader to try to arrange four pairs of different colored blocks such that one block was between a pair of blocks of color A, two blocks between a pair of blocks of color B, three blocks between a pair of blocks of color C, and finally four blocks between a pair of blocks of color D.
The unique solution is: DACABDCB.
There are 26 solutions to the 7 pair problem. Using numbers to represent block colors, here is one solution I came up with: 73625324765141.
Check out this link if you are interested in exploring the problem in greater detail:
http://legacy.lclark.edu/~miller/langford.html

[...] going to post this puzzle tomorrow but I realized that leaving the inquisitive readers with just a solution to Langford’s problem would be very ill mannered. So here we go again! This one, like many others I will write about, [...]
Blue-Empty Graph « Yooklid
December 26, 2010 at 5:46 am