Finding Kissing Numbers with Game-theoretic Reinforcement Learning

T1Covered by 1 source · first reported by arXiv at 24 Sept, 04:00 UTC

arXiv:2511.13391v5 Announce Type: replace-cross Abstract: Since Isaac Newton first studied the Kissing Number Problem in 1694, determining the maximal number of non-overlapping spheres around a central sphere has remained a defining challenge in discrete geometry. As the local analogue of Hilbert's…

science

Sources

• T1Finding Kissing Numbers with Game-theoretic Reinforcement LearningarXiv24 Sept, 04:00