A long-standing problem in discrete geometry involving how many pairs of points can be exactly one unit apart has been addressed using an artificial intelligence system developed by OpenAI, according to company research published on its official site
The problem, known as the planar unit distance problem, asks for the maximum number of pairs at distance one among n points in a plane. It was first introduced in 1946 by Hungarian mathematician Paul Erdős and has remained one of the most widely studied questions in combinatorial geometry.
