arXiv (All)
open access
Finding Kissing Numbers with Game-theoretic Reinforcement Learning
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 18th problem, it has profound implications across geometry
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning In-Hand Object Reaching to General 6D Poses#1083264
- Neurobiology of Mathematics (Cap 3) - ko#179352
- Related Data for: Narrowing the coordination solution space during motor learning standardizes individual patterns of search strategy but diversifies learning rates#378632
- Dynamic Buffers: Cost-Efficient Planning for Tabletop Rearrangement with Stacking#1115481
- How to make progress in theories of spatial clustering: A case study of Malmberg and Maskell's emerging theory#274669
Record · ID 1061646
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive