No Repeated Distances

Pick lattice points so that all distances between two points are unique. What is the tightest packing of these points? This Demonstration shows the best known results, as given in [1].


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


The tightest packing problem was the subject of [1]. Of the many participants, the winner was Hugo Pfoertner.
[1] A. Zimmermann. "Al Zimmermann's Programming Contests: Point Packing." (Oct 10, 2009)
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.