About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
November 2024 - Solution
November 2024 Solution:
The solutions are [177, 245, 137, 280, 217, 69]
and [345, 252, 245, 94, 102, 9]
A common way to solve the puzzle is through the expansion of the Cayley-Menger determinant
Many solvers had problems due to the limits of floating point precision computations. An interesting example arises for the "solution" [1,x,x,x-1,x-1,2] which gives the determinant - 32 for every value of x, but when using numpy's determinat method yields 255.99999991524982 for x = 524283. It was better to avoid numpy's implementation and use the [Bareiss algorithm] which allows one to use only integer operations, or even compute the determinant naively using recursion on minors.